Email this article 
Queueing Systems with Renovation. Stationary Probability Distribution
- Authors: Bocharov P.P.1, Zaryadov I.S.1
-
Affiliations:
- Peoples' Friendship University of Russia
- Issue: No 1-2 (2007)
- Pages: 14-23
- Section: Mathematics
- URL: https://journals.rudn.ru/miph/article/view/51117
- EDN: https://elibrary.ru/JWJLMV
- ID: 51117
Cite item
Full Text
Abstract
The Marcovian queueing systems with renovation are revised. The matrix algorithm for computing the stationary distribution of the Markov process is described. As examples of the method the algorithms for exponential systems are given --- queueing systems $M/M/n/r$ without reservice and $M/M/n/r$ with reservice.
About the authors
P. P. Bocharov
Peoples' Friendship University of Russia6, Miklukho-Maklaya str., Moscow, 117198, Russia
I. S. Zaryadov
Peoples' Friendship University of Russia6, Miklukho-Maklaya str., Moscow, 117198, Russia
References
- Kreinin A. Queueing Systems with Renovation // Journal of Applied Math. Stochast. Analysis. - Vol. 10, No 4. - 1997. - Pp. 431-443.
- Kreinin A. Inhomogeneous Random Walks: Applications in Queueing and Finance // CanQueue / Fields Institute. - Toronto: 2003.
- Towsley D., Tripathi S. K. A single server priority queue with server failure and queue flushing. - 1999.
- Бочаров П. П., Печинкин А. В. Теория массового обслуживания. - М.: РУДН, 1995. - С. 529.
- Naoumov V. A. Matrix-multiplicative approach to quasi- birth-and-death processes analysis // Proc. First Internat. Conf. on Matrix-Analytic Methods in Stochastic Models. - Detroit: 1995.
Supplementary files
