Abstract
This paper presents an efficient equilibrium solution algorithm for infinite multi-dimensional Markov chains of the quasi-birth-and-death (QBD) type. The algorithm is not based on an iterative approach, so that the exact solution can be computed in a known, finite number of steps. The key step on which the algorithm is based, is the identification of a linear dependence among variables. This dependence is expressed in terms of a matrix whose size is finite. The equilibrium solution of the Markov chain is obtained operating on this finite matrix. An extremely attractive feature of the newly proposed algorithm is that it allows the computation of approximate solutions with any desired degree of accuracy. The solution algorithm, in fact, computes a succession of approximate solutions with growing accuracy, until the exact solution is achieved in a finite number of steps.
Results for a case study show that the proposed algorithm is very efficient and quite accurate, even when providing approximate solutions.
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
M. Neuts. Matrix-Geometric Solutions in Stochastic Models. The Johns Hopkins University Press, 1981.
G. Latouche. Algorithms for infinite Markov chains with repeating columns. In Linear Algebra, Markov Chains, and Queueing Models, pages 231–266. Springer, 1993.
G. Latouche and V. Ramaswami. A logarithmic reduction algorithm for quasi-birth-death processes. J. App. Prob., 30:650–674, 1993.
G. Latouche and G.W. Stewart. Numerical methods for M/G/1 type queues. In Computations with Markov Chains, pages 571–581. Kluwer Academic Publishers, 1995.
D. Bini and B. Meini. On cyclic reduction applied to a class of Toeplitz-like matrices arising in queueing problems. In Computations with Markov Chains, pages 21–38. Kluwer Academic Publishers, 1995.
W.J. Stewart. Introduction to the Numerical Solution of Markov Chains. Princeton University Press, 1994.
W.E. Arnoldi. The principle of minimized iteration in the solution of the matrix eigenvalue problem. Quarterly for Applied Mathematics, 9:17–29, 1951.
Y. Saad. Variations on Arnoldi’s method for computing eigenelements of large unsymmetric matrices. Linear Algebra and Its Applications, 34:269–295, 1980.
G.H. Golub and C.F. Van Loan. Matrix Computations. The Johns Hopkins University Press, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meo, M., de Souza e Silva, E., Marsan, M.A. (2000). Exact and Approximate Solutions for a Class of Infinite Markovian Models. In: Haverkort, B.R., Bohnenkamp, H.C., Smith, C.U. (eds) Computer Performance Evaluation.Modelling Techniques and Tools. TOOLS 2000. Lecture Notes in Computer Science, vol 1786. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46429-8_8
Download citation
DOI: https://doi.org/10.1007/3-540-46429-8_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67260-9
Online ISBN: 978-3-540-46429-7
eBook Packages: Springer Book Archive