Transient Analysis of Large Markov Models with Absorbing States Using Regenerative Randomization

ABSTRACT In this article, we develop a new method, called regenerative randomization, for the transient analysis of continuous time Markov models with absorbing states. The method has the same good properties as standard randomization: numerical stability, well-controlled computation error, and ability to specify the computation error in advance. The method has a benign behavior for large t and is significantly less costly than standard randomization for large enough models and large enough t. For a class of models, class C, including typical failure/repair reliability models with exponential failure and repair time distributions and repair in every state with failed components, stronger theoretical results are available assessing the efficiency of the method in terms of “visible” model characteristics. A large example belonging to that class is used to illustrate the performance of the method and to show that it can indeed be much faster than standard randomization.

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

[2]  Peter W. Glynn,et al.  Computing Poisson probabilities , 1988, CACM.

[3]  Winfried K. Grassmann,et al.  Transient solutions in Markovian Queueing Systems , 1977, Comput. Oper. Res..

[4]  Juan A. Carrasco,et al.  Regenerative randomization: theory and application examples , 1995, SIGMETRICS '95/PERFORMANCE '95.

[5]  Andreas Karlsson,et al.  Matrix Analysis for Statistics , 2007, Technometrics.

[6]  Kishor S. Trivedi,et al.  SPNP: stochastic Petri net package , 1989, Proceedings of the Third International Workshop on Petri Nets and Performance Models, PNPM89.

[7]  Gerardo Rubino,et al.  Interval availability distribution computation , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.

[8]  Kishor S. Trivedi,et al.  STIFFNESS-TOLERANT METHODS FOR TRANSIENT ANALYSIS OF STIFF MARKOV CHAINS , 1994 .

[9]  Bruno Sericola.  Availability Analysis of Repairable Computer Systems and Stationarity Detection , 1999, IEEE Trans. Computers.

[10]  W. Sanders.  Adaptive Uniformization , 1994 .

[11]  R. Ramaswami,et al.  Book Review: Design and Analysis of Fault-Tolerant Digital Systems , 1990 .

[12]  Manish Malhotra,et al.  A Computationally Efficient Technique for Transient Analysis of Repairable Markovian Systems , 1996, Perform. Evaluation.

[13]  Kishor S. Trivedi,et al.  Numerical transient analysis of markov models , 1988, Comput. Oper. Res..

[14]  William H. Sanders,et al.  Performability Modeling with UltraSAN , 1991, IEEE Softw..

[15]  Edmundo de Souza e Silva,et al.  Calculating availability and performability measures of repairable computer systems using randomization , 1989, JACM.

[16]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[17]  A. Calderon,et al.  Computation of absorption probability distributions of continuous-time Markov chains using regenerative randomization , 1995, Proceedings of 1995 IEEE International Computer Performance and Dependability Symposium.

[18]  A. Bobbio,et al.  A benchmark for ph estimation algorithms: results for acyclic-ph , 1994 .

[19]  Donald Gross,et al.  The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes , 1984, Oper. Res..

[20]  William H. Sanders,et al.  Reward Model Solution Methods with Impulse and Rate Rewards: An Algorithm and Numerical Results , 1994, Perform. Evaluation.

[21]  D. R. Miller.  Reliability calculation using randomization for Markovian fault-tolerant computing systems , 1982 .

[22]  L. Knüsel.  Computation of the chi square and Poisson distribution , 1986 .

[23]  Gerardo Rubino,et al.  Interval Availability Analysis Using Denumerable Markov Processes: Application to Multiprocessor Subject to Breakdowns and Repair , 1995, IEEE Trans. Computers.

[24]  Winfried K. Grassmann,et al.  Rounding errors in certain algorithms involving Markov chains , 1993, TOMS.

[25]  Bruno Sericola,et al.  Performability Analysis: A New Algorithm , 1996, IEEE Trans. Computers.

[26]  Barry W. Johnson.  Design & analysis of fault tolerant digital systems , 1988 .

[27]  E. Scheuer,et al.  Calculation of the Poisson cumulative distribution function (reliability applications) , 1990 .

[28]  E. Seneta.  Non-negative Matrices and Markov Chains (Springer Series in Statistics) , 1981 .

[29]  Winfried K. Grassmann.  Transient solutions in markovian queueing systems , 1977, Comput. Oper. Res..

[30]  Micha Yadin,et al.  Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes , 1984, Oper. Res..

[31]  M. R. Spiegel.  Mathematical handbook of formulas and tables , 1968 .

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

[33]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[34]  Jean Arlat,et al.  SURF-2: A program for dependability evaluation of complex hardware and software systems , 1993, FTCS-23 The Twenty-Third International Symposium on Fault-Tolerant Computing.

[35]  William H. Sanders,et al.  Transient solution of Markov models by combining adaptive and standard uniformization , 1997 .

[36]  Sheldon M. Ross,et al.  Stochastic Processes , 2018, Gauge Integral Structures for Stochastic Calculus and Quantum Electrodynamics.

[37]  Edmundo de Souza e Silva,et al.  Calculating Cumulative Operational Time Distributions of Repairable Computer Systems , 1986, IEEE Transactions on Computers.

[38]  Lorenzo Donatiello,et al.  Analysis of a composite performance reliability measure for fault-tolerant systems , 1987, JACM.

[39]  Marcel F. Neuts,et al.  Matrix-geometric solutions in stochastic models - an algorithmic approach , 1982 .

[40]  E. D. S. E. Silva,et al.  An algorithm to calculate transient distributions of cumulative rate and impulse based reward , 1998 .