Seventh IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'99)
Failure Distance Based Bounds for Steady-State Availability without the Knowledge of Minimal Cuts
College Park, Maryland
March 24-March 28
ISBN: 0-7695-0381-0
We propose an algorithm to compute bounds for the steady-state unavailability using continuous-time Markov chains, which is based on the failure distance concept. The algorithm generates incrementally a subset of the state space until the tightness of the bounds is the specified one. In contrast with a previously proposed algorithm also based on the failure distance concept, the proposed algorithm uses lower bounds for failure distances which are computed on the fault tree of the system, and does not require the knowledge of the minimal cuts. This is advantageous when the number of minimal cuts is large or their computation is time-consuming.
Index Terms:
Fault-tolerant systems, continuous-time Markov chains, steady-state availability, bounds, failure distance
Citation:
Victor Sunye, Juan A. Carrasco, "Failure Distance Based Bounds for Steady-State Availability without the Knowledge of Minimal Cuts," mascots, pp.138, Seventh IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS'99), 1999
Usage of this product signifies your acceptance of the
Terms of Use.
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb