Abstract
Computation of transient state occupancy probabilities of continuous-time Markov chains is important for evaluating many performance, dependability, and performability models. A number of numerical methods have been developed to perform this computation, including ordinary differential equation solution methods and uniformization. The performance of these methods degrades when the highest departure rate in the chain increases with respect to a fixed time point. A new variant of uniformization, called adaptive uniformization (AU), has been proposed that can potentially avoid such degradation, when several state transitions must occur before a state with a high departure rate is reached. However, in general, AU has a higher time complexity than standard uniformization, and it is not clear, without an implementation, when All will be advantageous. This paper presents the results of three different AU implementations, differing in the method by which the “jump probabilities” are calculated. To evaluate the methods, relative to standard uniformization, a C++ class was developed to compute a bound on the round-off error incurred by each implementation, as well as count the number of arithmetic instructions that must be performed, categorized both by operation type and phase of the algorithm they belong to. An extended machine-repairman reliability model is solved to illustrate use of the class and compare the adaptive uniformization implementations with standard uniformization. Results show that for certain models and mission times, adaptive uniformization can realize significant efficiency gains, relative to standard uniformization, while maintaining the stability of standard uniformization.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J.A. Couvillion, R. Freire, R. Johnson, W.D. Obal II, M.A. Qureshi, R. Rai, W.H. Sanders and J. Tvedt, “Performability Modeling with U1traSAN,” IEEE Software, 8, (Sept. 1991), pp. 69–80.
J. Dunkel and H. Stahl, “On the Transient Analysis of Stiff Markov Chains,” Proc. Third Working Conference on Dependable Computing for Critical Apllications, Modello, Italy, Sept. 1992.
W. Feller, An Introduction to Probability Theory and Its Applications,Volume I and II, New York, 1966.
B.L. Fox and P.W. Glynn, “Computing Poisson Probabilities,” Comm. ACM 31, pp. 440–445, 1988.
R. Geist and K.S. Trivedi, “Ultra-high Reliability Prediction for Fault-Tolerant Computer Systems,” IEEE Trans. on Comp.,C-32(12), pp. 1118–1127, December 1983.
A. Goyal, S. Lavenberg and K.S. Trivedi, “Probabilistic Modeling of Computer System Availability,” Annals of Operation Research, 8, pp. 285–306, 1987.
W.K. Grassman, “Transient Solutions in Markovian queueing systems,” Computers & Operations Research 4, pp. 47–53, 1977.
W.K. Grassman, “Finding Transient Solutions in Markovian Event Systems through Randomization,” in Numerical Solution of Markov Chains, W.J. Stewart (Ed.), Marcel Dekker, New York, 1991.
A. Jensen, “Markoff chains as an Aid in the Study of Markoff Processes,” Skand. Aktuarietidskrift., 36, pp. 87–91, 1953.
C. Lindemann, Private Communication, November 1993.
C. Lindemann, M. Malhotra and K.S. Trivedi, “Numerical Methods for Reliability Evaluation of Closed Fault-tolerant Systems,” Technical Report, Duke University, 1992.
M. Malhotra, “A Unified Approach for Transient Analysis of Stiff and Non-Stiff Markov Models,” Technical Report DUKE-CCSR-92–001, Center for Computer Systems Research, Duke University, 1992.
A.P.A. van Moorsel, “Performability Evaluation Concepts and Techniques,” Ph.D. Thesis, University of Twente, 1993.
A.P.A van Moorsel and W.H. Sanders,“ Adaptive Uniformization,” Stochastic Models, 10:3, 1994.
A.P.A. van Moorsel and W.H. Sanders,“ Adaptive Uniformization: Technical Details,” PMRL Technical Report 93–4, University of Arizona, 1992.
R.A. Marie, A.L. Reibman and K.S. Trivedi, “Transient Analysis of Acyclic Markov Chains,” Perf. Eval. 7, pp. 175–194, 1987.
A. Reibman, R. Smith and K.S. Trivedi, “Markov and Markov Reward Model Transient Analysis: An Overview of Numerical Approaches,” European Journal of Operational Research, 40, pp. 257–267, 1989.
A. Reibman and K.S. Trivedi, “Numerical Transient Analysis of Markov Models,” Comput. Opns Res. 15, pp. 19–36, 1988.
N.C. Severo, “A Recursion Theorem on Solving Differential- Difference Equations and Applications to some Stochastic Processes,” J. Appl. Prob. 6, pp. 673–681, 1969.
P.H. Sterbenz, Floating-Point Computation, Prentice-Hall, Englewood Cliffs, 1974.
B. Stroustrup, The C++ Programming Language, Addison-Wesley, Reading, Mass., 1987.
K.S. Trivedi, Probability and Statistics with Reliability, Queueing, and Computer Science Applications, Prentice-Hall, Englewood Cliffs, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media New York
About this paper
Cite this paper
Diener, J.D., Sanders, W.H. (1995). Empirical Comparison of Uniformization Methods for Continuous-Time Markov Chains. In: Stewart, W.J. (eds) Computations with Markov Chains. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2241-6_29
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2241-6_29
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5943-2
Online ISBN: 978-1-4615-2241-6
eBook Packages: Springer Book Archive