Numerical transient analysis of markov models

https://doi.org/10.1016/0305-0548(88)90026-3Get rights and content

Abstract

We consider the numerical evaluation of Markov model transient behavior. Our research is motivated primarily by computer system dependability modeling. Other application areas include finitecapacity queueing models, closed queueing networks and inventory models. We focus our attention on the general problem of finding the state probability vector of a large, continuous-time, discrete-state Markov chain. Two computational approaches are examined in detail: uniformization and numerical linear multistep methods for ordinary differential equation solution. In general, uniformization provides greater accuracy but deals poorly with stiffness. A special stable ordinary differential equation solver deals well with stiffness, but it provides increased accuracy only at much greater cost. Examples are presented to illustrate the behavior of the techniques discussed as a function of model size, model stiffness, increased accuracy requirements and mission time.

References (26)

  • R. Geist et al.

    Ultra-high reliability prediction for fault-tolerant computer systems

    IEEE Transact. Comput.

    (1983)
  • A. Goyal et al.

    Probabilistic modeling of computer system availability.

    Ann. Opns Res.

    (1987)
  • K. S. Trivedi, Probability and Statistics with Reliability, Queuing, and Computer Science Applications. Prentice-Hall,...
  • W.K. Grassmann

    Transient solution in Markovian queueing systems

    Comput. Opns Res.

    (1977)
  • S.K. Tripathi et al.

    Time dependent analysis of queueing systems

    INFOR

    (1986)
  • D. Gross et al.

    Simulation methodologies for transient Markov processes: a comparative study based on multi-echelon repairable item inventory systems

  • K.S. Trivedi et al.

    Hybrid modeling of fault-tolerant systems

    Comput. Elect. Engng

    (1984)
  • R.A. Sahner et al.

    A hierarchical, combinatorial-Markov method of solving complex reliability models

  • A. Bobbio et al.

    An aggregation technique for the transient analysis of stiff Markov chains

    IEEE Transact. Comput.

    (1986)
  • G.H. Golub et al.

    Matrix Computations

    (1983)
  • C. Moler et al.

    Nineteen dubious ways to compute the exponential of a matrix

    SIAM Rev.

    (1978)
  • C.F. Van Loan

    The sensitivity of the matrix exponential

    SIAM J. Numer. Anal.

    (1977)
  • J.R. Roche

    On the sensitivity of the matrix exponential problem

    RAIRO Analyse Numerique

    (1981)
  • Cited by (0)

    Andrew L. Reibman received the B.S. degree in mathematics and computer science from Lenoir-Rhyne College, Hickory, N.C., in 1982. He is currently a Ph.D. candidate in computer science at Duke University. His research interests include computer system reliability and performance modelling, fault-tolerant computing and numerical analysis.

    Kishor S. Trivedi received the B.Tech. degree from the Indian Institute of Technology (Bombay) and M.S. and Ph.D. degrees in computer science from the University of Illinois, Urbana-Champaign. He is the author of a widely used text on Probability and Statistics with Reliability, Queuing and Computer Science Applications, published by Prentice-Hall. Both the text and his related research activities, have been focused on establishing a unified mathematical modeling foundation for computing system reliability and performance evaluation. Presently, he is a Professor of Computer Science and Electrical Engineering at Duke University, Durham, N.C. He has served as a Principal Investigator on various AFOSR, ARO, Burroughs, IBM, NASA, NIH and NSF funded projects and as a consultant to industry and research laboratories. He is an Editor of the IEEE Transactions on Computers.

    View full text