Abstract
We present a new algorithm for solving discrete-time Markov chains where transition probabilities have several orders of magnitude. Our method combines the decomposition by perturbation and the reduction approaches. In the decomposition phase, we remove from the chain some transitions with very small probabilities. But we assume that the reduced graph is still strongly connected after the deletion. A transversal (a cut set of the directed cycles) is then obtained and the reduction method is used to compute the first approximation of the steady-state distribution. Further approximations may be computed iteratively to obtain the desirable accuracy. We prove the algorithm and present some examples.
This is a preview of subscription content, log in via an institution to check access.
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
C. Berge. Graphes et Hypergraphes. Dunod, 1970.
P.-J. Courtois. Error analysis in nearly-completely decomposable stochastic systems. Econometrica, 43(4):691–709, 1975.
P.-J. Courtois. Decomposability: queuing and computer system applications. Academic Press, 1977.
G. Fayolle, V.A. Malyshev, and Menshikov M.V. Topics in the constructive theory of countable Markov chain. 1993.
J.-M. Fourneau and Quessette F. Graphs and stochastic automata networks. In Computations with Markov Chains, Kluwer, Edited by W.J. Stewart, 1995.
M.R. Garey and D.S. Johnson. Computers and Intractability, a Guide to the theory of NP-Completeness. W.H. Freeman and Company, 1979.
E. Gelenbe and I. Mitrani. Analysis and synthesis of computer systems. Academic press, 1980.
J.J. Hunter. Mathematical Techniques of Applied Probability. Academic Press, 1933.
R. Jain. The art of computer systems performance analysis. Wiley, 1992.
R. Koury, D.F. McAllister, and W.J. Stewart. Methods for computing stationary distribution of a large markov chain. SIAM J. Algebraic and Discrete Mathematics, 5:164–186, 1984.
R. Lal and U.N. Bhat. Reduced systems in markov chains and their applications in queueing theory. Queueing Systems, 2, 1987.
L.M. Malhis and W.H. Sanders. An efficient two-stage iterative method for the steady-state analysis of markov regenerative stochastic petri net models. In Performance Evaluation, pages 583–601, 1996.
C.D. Meyer. Stochastic complementation, uncoupling markov chains, and the theory of nearly reducible systems. SIAM review, 31(2):240–272, June 1989.
R. Robertazzi. Recursive solution of a class of non-product form protocol models. In INFOCOM, 1989.
W.J. Stewart. An Introduction to the Numerical Solution of Markov Chains. Princeton, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fourneau, J.M., Mokdad, L. (1998). A Perturbation and Reduction Based Algorithm. In: Puigjaner, R., Savino, N.N., Serra, B. (eds) Computer Performance Evaluation. TOOLS 1998. Lecture Notes in Computer Science, vol 1469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68061-6_12
Download citation
DOI: https://doi.org/10.1007/3-540-68061-6_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64949-6
Online ISBN: 978-3-540-68061-1
eBook Packages: Springer Book Archive