Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
article
Free access

Efficient exploration of availability models guided by failure distances

Published: 15 May 1996 Publication History

Abstract

Recently, a method to bound the steady-state availability using the failure distance concept has been proposed. In this paper we refine that method by introducing state space exploration techniques. In the methods proposed here, the state space is incrementally generated based on the contributions to the steady-state availability band of the states in the frontier of the currently generated state space. Several state space exploration algorithms are evaluated in terms of bounds quality and memory and CPU time requirements. The more efficient seems to be a waved algorithm which expands transition groups. We compare our new methods with the method based on the failure distance concept without state exploration and a method proposed by Souza e Silva and Ochoa which uses state space exploration but does not use the failure distance concept. Using typical examples we show that the methods proposed here can be significantly more efficient than any of the previous methods.

References

[1]
R.E. Barlow and F. Proschan, Statistical Theory o.f Reliability and Life Testing. Probability Models, McArdle Press, Silver Spring, 1981.
[2]
j. A. Carrasco and J. Figueras, "METFAC: Design and Implementation of a Software Tool for Modeling and Evaluation of Complex Fault-Tolerant Computing Systems," in Proc. 16th Int. Syrup. on Fault-Tolerant Computin9 FTCS.16, 1986, pp. 424-429.
[3]
J.A. Carrasco, "Analysis of Sparse Numerical Methods for Dependability Evaluation," in Proc. 16th IAESTED Int. Conf. on Identification, Modeling and Simulation, 1987~ pp. 437-441.
[4]
J. A. Carrasco, "Failure distance-based Simulation of Repairable Fault-Tolerant Systems," in Computer Performance Evaluation, Elsevier, 1992, pp. 351-366.
[5]
j. A. Carrasco, "Improving Availability Bounds using the Failure distance Concept", in Dependable Computing and Fault.Tolerant Systems, vol. 9, Springer- Verlag, 1995, pp. 479-497.
[6]
E. (~inlar, Introduction to Stochastic Processes, Prentice-Hall, Inc., New Jersey, 1975.
[7]
P.J. Courtois aatd P. Semal, "Bounds for the positive eigenvectors of nonnegatlve matrices and for their approximations," Journal of the A CM, vol. 31, no. 4, pp. 804-825, October 1984.
[8]
P.3. Courtois and P. Semal, "Computable bounds for conditional steady-state probabilities in large Markov chains and queuing models," IEEE J. of Selected Areas in Communications, vol. SAC-4, no. 6, September 1986, pp. 926-937.
[9]
S.-N. Chiou and V.O.K. Li, "Reliability Analysis of a Communication Network with Multimode Components." IEEE J. of Selected Areas in Communications, vol. SAC-4, no. 7, October 1986, pp. 1156-1161.
[10]
M. Dal Cin, "Availability Analysis of a Fault-Tolerant Computer System," 1EEE Trans. on Reliability, vol. R-29, no. 3, August 1980, pp. 265-268.
[11]
A. Goyal, W. C. Carter, E. de Souz~ e Silva, ~nd S. S. Labenverg, "The System Availability Estimator," in Proc. 16th Int. Syrup. on Fault-Tolerant Computing FTC~q-16, 1986, pp. 84-89.
[12]
A, Goyal, P. Shahabuddin, P. Heidelberger, V.F. Nicola, and P.W. Glynn, "A Unified Framework for Simulating Markovian Models of Highly Dependable: Systems," IEEE Trans. on Computers, vol. 41, no. 1, January 1992, pp, 36-51.
[13]
Y.F. Lain and V.O.K. Li, "An Improved Algorithm, for Performance Analysis of Networks with Unreliable Components," IEEE Trans. on Communications, vol~ COM-34, no. 5, May 1986, pp. 496-497.
[14]
V.O.K. Li and J.A. Silvester, "Performance Analysis of Networks with Unreliable Components," IEEE Trans. on Communications, vol. COM-32, no. 10, October 1984, pp. 1105-1110.
[15]
J.C.S. Lui and R. Muntz, "Evaluating Bounds on Steady-State Availability of Repairable Systems from Markov Models," in Numerical Solution of Markov chains, Marcel Dekker, New York, pp. 435-454, 1991.
[16]
J.C.S. Lui and R. Muntz, "Computing Bounds on Steady State Availability of Repairable Computer Systems," Journal of the A CM, vol. 41, no. 4, July 1994, pp. 676-707.
[17]
N.F. Maxemchuk and K. Sabnani, "Pmbabilistlc Verification of Communication Protocols," in Proc. of the IFIF 7th lnt. Conf. on Protocol Specification, Testing, and Verification, North-Holland, 1987, pp. 307-320.
[18]
R.R. Muntz, E. de Souza e Silva and A. Goyal, "Bounding Availability of Repairable Computer Systems," 1EEE Trans. on Computers, vol. 38, no. 12, pp. 1714- 1723, December 1989.
[19]
V.F. Nicola, M. Nakayama, P. Heidelberger and A. Goyal, "Fast simulation of dependability models with general failure, repair and maintenance processes," in Proc. ~Oth IEEE Int. Syrup. on Fault. Tolerant Computing FTCS.P.O, 1990, pp. 491-498.
[20]
V.F. Nicola, P. Shahabuddin, P. Heidelberger, and P.W. Glynn, "Fast simulation of steady-state availability in non-markovian highly dependable systems," in Proc. ~3th IEEE int. Syrup. on Fault. Tolerant Com. puting FTCS-23, 1993, pp. 38-47.
[21]
E. de Souza e Silva and P,M. Ochoa, "State Space Exploration in Markov Models," Performance Evaluation Review, vol. 20, no. 1, June 1992, pp. 152-166.
[22]
Ch.-L. Yang and P. Kubat, "Efficient Computation of Most Probable States for Communication Networks with Multimode Components," IEEE Trans. on Communications, vol. 37, no. 5, May 1989, pp. 535-538.

Cited By

View all
  • (2001)Measure-adaptive state-space constructionPerformance Evaluation10.1016/S0166-5316(00)00052-344:1-4(237-258)Online publication date: 1-Apr-2001
  • (2000)Measure-adaptive state-space constructionProceedings IEEE International Computer Performance and Dependability Symposium. IPDS 200010.1109/IPDS.2000.839461(25-34)Online publication date: 2000
  • (1999)Failure distance based bounds for steady-state availability without the knowledge of minimal cutsMASCOTS '99. Proceedings of the Seventh International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems10.1109/MASCOT.1999.805049(138-147)Online publication date: 1999
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review
ACM SIGMETRICS Performance Evaluation Review  Volume 24, Issue 1
May 1996
273 pages
ISSN:0163-5999
DOI:10.1145/233008
Issue’s Table of Contents
  • cover image ACM Conferences
    SIGMETRICS '96: Proceedings of the 1996 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
    May 1996
    279 pages
    ISBN:0897917936
    DOI:10.1145/233013
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 15 May 1996
Published in SIGMETRICS Volume 24, Issue 1

Check for updates

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)31
  • Downloads (Last 6 weeks)6
Reflects downloads up to 10 Oct 2024

Other Metrics

Citations

Cited By

View all
  • (2001)Measure-adaptive state-space constructionPerformance Evaluation10.1016/S0166-5316(00)00052-344:1-4(237-258)Online publication date: 1-Apr-2001
  • (2000)Measure-adaptive state-space constructionProceedings IEEE International Computer Performance and Dependability Symposium. IPDS 200010.1109/IPDS.2000.839461(25-34)Online publication date: 2000
  • (1999)Failure distance based bounds for steady-state availability without the knowledge of minimal cutsMASCOTS '99. Proceedings of the Seventh International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems10.1109/MASCOT.1999.805049(138-147)Online publication date: 1999
  • (1999)An algorithm to find minimal cuts of coherent fault-trees with event-classes, using a decision treeIEEE Transactions on Reliability10.1109/24.76592548:1(31-41)Online publication date: Mar-1999
  • (1999)Bounding steady-state availability models with group repair and phase type repair distributionsPerformance Evaluation10.1016/S0166-5316(99)00002-435:3-4(193-214)Online publication date: 1-May-1999
  • (1998)Bounding steady-state availability models with phase type repair distributionsProceedings. IEEE International Computer Performance and Dependability Symposium. IPDS'98 (Cat. No.98TB100248)10.1109/IPDS.1998.707728(259-268)Online publication date: 1998
  • (1998)Approximations for steady-state measures in highly dependable systems with generally distributed component failure and repair timesProceedings. IEEE International Computer Performance and Dependability Symposium. IPDS'98 (Cat. No.98TB100248)10.1109/IPDS.1998.707726(238-248)Online publication date: 1998
  • (1997)A method for the computation of reliability bounds for non-repairable fault-tolerant systemsProceedings Fifth International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems10.1109/MASCOT.1997.567616(221-228)Online publication date: 1997

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media