Transient analysis of quasi-birth-death processes
- 1 January 1989
- journal article
- research article
- Published by Taylor & Francis in Communications in Statistics. Stochastic Models
- Vol. 5 (3) , 459-496
- https://doi.org/10.1080/15326348908807119
Abstract
The concept of Complete Level Crossing Information is shown to lead to a matrix geometric solution for the transform of the distribution of the number in queue at each time t in queues modeled as Quasi-Birth-Death (QBD) processes. Specifically, if (t) is the vector of probabilities of state occupancy at time t for the states on level n of a QBD-process given the process starts from level 1 at , and if is the Laplace transform of , then there exists a square matrix W(s) such that: We also show how to determine the boundary vectors and , for this recursion To illustrate this method, a QBD process which models a CSMA/CD network is analyzed in detail. The mean number of busy users in the network and the tail distribution, both of which are functions of time, are computed from the closed-form expressions for the transform domain recursion. These results are significant since they should greatly expand the class of queues for which transient analysis is tractable.Keywords
This publication has 13 references indexed in Scilit:
- A method for the numerical inversion of Laplace transformsPublished by Elsevier ,2002
- Comparison of generalized Q- function algorithms (Corresp.)IEEE Transactions on Information Theory, 1987
- A Matrix Representation of CSMA/CD NetworksIEEE Transactions on Communications, 1985
- Matrix-Geometric Solutions to Stochastic ModelsPublished by Springer Nature ,1984
- Finite Population CSMA/CD NetworksIEEE Transactions on Communications, 1983
- Birth-and-death processes on the integers with phases and general boundariesJournal of Applied Probability, 1982
- M/M/1 Transient State Occupancy Probabilities Via the Discrete Fourier TransformIEEE Transactions on Communications, 1982
- Approximations of Queue Dynamics and Their Application to Adaptive Routing in Computer Communication NetworksIEEE Transactions on Communications, 1979
- Nineteen Dubious Ways to Compute the Exponential of a MatrixSIAM Review, 1978
- Transient solutions in Markovian queuesEuropean Journal of Operational Research, 1977