Article contents
Transient solutions for denumerable-state Markov processes
Published online by Cambridge University Press: 14 July 2016
Abstract
The algorithm for the transient solution for the denumerable state Markov process with an arbitrary initial distribution is given in this paper. The transient queue length distribution for a general Markovian queueing system can be obtained by this algorithm. As examples, some numerical results are presented.
MSC classification
- Type
- Research Papers
- Information
- Copyright
- Copyright © Applied Probability Trust 1994
Footnotes
Supported by the National Natural Science Foundation of China.
References
- 5
- Cited by