Accelerating Mean Time to Failure Computations

Abstract In this paper we consider the problem of numerical computation of the mean time to failure (MTTF) in Markovian dependability and/or performance models. The problem can be cast as a system of linear equations which is solved using an iterative method preserving sparsity of the Markov chain matrix. For highly dependable systems, system failure is a rare event and the above system solution can take an extremely large number of iterations. We propose to solve the problem by dividing the computation in two parts. First, by making some of the high probability states absorbing, we compute the MTTF of the modified Markov chain. In a subsequent step, by solving another system of linear equations, we are able to compute the MTTF of the original model. We prove that for a class of highly dependable systems, the resulting method can speed up computation of the MTTF by orders of magnitude. Experimental results supporting this claim are presented. We also obtain bounds on the convergence rate for computing the mean entrance time of a rare set of states in a class of queueing models.

[1]  Kishor S. Trivedi,et al.  THE SYSTEM AVAILABILITY ESTIMATOR , 1996 .

[2]  J. Keilson.  Markov Chain Models--Rarity And Exponentiality , 1979 .

[3]  Kai Lai Chung,et al.  Markov Chains with Stationary Transition Probabilities , 1961 .

[4]  R. Cottle.  Manifestations of the Schur complement , 1974 .

[5]  J. Coolidge.  A Treatise on Algebraic Plane Curves , 1959 .

[6]  S. Karlin,et al.  A second course in stochastic processes , 1981 .

[7]  Samuel Karlin,et al.  A First Course on Stochastic Processes , 1968 .

[8]  Kishor S. Trivedi,et al.  Markov Dependability Models of Complex Systems: Analysis Techniques , 1996 .

[9]  Paul Glasserman,et al.  Analysis of an importance sampling estimator for tandem queues , 1995, TOMC.

[10]  Stephen S. Lavenberg,et al.  Modeling and Analysis of Computer System Availability , 1987, Computer Performance and Reliability.

[11]  Perwez Shahabuddin,et al.  Importance sampling for the simulation of highly reliable Markovian systems , 1994 .

[12]  Kishor S. Trivedi,et al.  Conditional MTTF and its computation in Markov reliability models , 1993, Annual Reliability and Maintainability Symposium 1993 Proceedings.

[13]  B. Noble.  Applied Linear Algebra , 1969 .

[14]  Gene H. Golub,et al.  Matrix computations , 1983 .

[15]  Kishor S. Trivedi,et al.  Sensitivity analysis of reliability and performability measures for multiprocessor systems , 1988, SIGMETRICS 1988.

[16]  Hong Chen,et al.  Discrete Flow Networks: Bottleneck Analysis and Fluid Approximations , 1991, Math. Oper. Res..

[17]  Kishor S. Trivedi,et al.  Automated Generation and Analysis of Markov Reward Models Using Stochastic Reward Nets , 1993 .

[18]  J. Gillis,et al.  Matrix Iterative Analysis , 1961 .

[19]  Philip Heidelberger,et al.  A Unified Framework for Simulating Markovian Models of Highly Dependable Systems , 1992, IEEE Trans. Computers.

[20]  D. Iglehart,et al.  Discrete time methods for simulating continuous time Markov chains , 1976, Advances in Applied Probability.

[21]  Juan A. Carrasco,et al.  Two new algorithms to compute steady-state bounds for Markov models with slow forward and fast backward transitions , 1996, Proceedings of MASCOTS '96 - 4th International Workshop on Modeling, Analysis and Simulation of Computer and Telecommunication Systems.

[22]  Jean Walrand,et al.  A quick simulation method for excessive backlogs in networks of queues , 1989 .