Bounding transient and steady-state dependability measures through algorithmic stochastic comparison

Authors:
Ana Bušić;Jean-Michel Fourneau
Affiliations:
Université de versailles St-Quentin, Versailles, France;Université de versailles St-Quentin, Versailles, France
Venue:
ACM SIGMETRICS Performance Evaluation Review
Year:
2006

Citing 3
Cited 0

Bounding Availability of Repairable Systems

IEEE Transactions on Computers
Bounding steady-state availability models with group repair and phase type repair distributions

IPDS '98 Proceedings of the third IEEE international performance and dependability symposium on International performance and dependability symposium
Bounds for point and steady-state availability: an algorithmic approach based on lumpability and stochastic ordering

EPEW'05/WS-FM'05 Proceedings of the 2005 international conference on European Performance Engineering, and Web Services and Formal Methods, international conference on Formal Techniques for Computer Systems and Business Processes

Quantified Score

Hi-index	0.01

Visualization

Abstract

We are interested in bounding dependability measures like point and steady-state availability and reliability of systems modelled by very large Markov chains which are not numerically tractable. We suppose that the state space is divided into two classes, UP (system is operational) and DOWN states. The reliability at time t is defined as the probability that the system has always been operational between 0 and t. The point availability is the probability that the system is operational at time t, and the steady-state availability is the limit, if it exists, of this probability.