Refinable bounds for large Markov chains

• Published in: IEEE transactions on computers Vol. 44; no. 10; pp. 1216 - 1222
• Main Author: Semal, P.
• Format: Journal Article
• Language: English
• Published: New York, NY IEEE 01.10.1995; Institute of Electrical and Electronics Engineers
• Subjects: Algorithmics. Computability. Computer arithmetics; Applied sciences; Availability; Computational complexity; Computer science; control theory; systems; Computer systems and distributed systems. User interface; Exact sciences and technology; Fault tolerant systems; Iterative methods; Matrix decomposition; Shape; Software; Software engineering; State-space methods; Steady-state; Stochastic processes; Theoretical computing; Availability; Markov processes; Agglomeration; Matrix algebra; Fault tolerant system
• ISSN: 0018-9340; 1557-9956
• DOI: 10.1109/12.467696

A method to bound the steady-state solution of large Markov chains is presented. It integrates the concepts of eigen-vector polyhedron and of aggregation and is iterative in nature. The bounds are obtained by considering a subset only of the system state space. This makes the method specially attractive for problems which are too large to be dealt with by traditional methods. The quality of the bounds depends on the locality of the system which is studied: when the system spends most of its time in a small subset of states, tight bounds can be obtained by considering this subset only. Finally, the bounds are refinable in the sense that the tightness of the bounds can be improved by enlarging the subset of states which is considered. The method Is illustrated on a model of a repairable fault-tolerant system with 16 million states. Tight bounds on its availability are obtained by considering less than 0.1 percent of its state space.< >