Email this article NONERGODICITY OF MATHEMATIC MODEL OF A RANDOM ACCESS NETWORK
- Authors: Nazarov A.A.1, Sudyko E.A.1, Nazarov AA1, Sudyko EA1
-
Affiliations:
- Issue: Vol 12, No 3 (2011)
- Pages: 62-65
- Section: Articles
- URL: https://journals.eco-vector.com/2712-8970/article/view/516408
- ID: 516408
Cite item
Full Text
Abstract
We have considered a random access communication network with conflicts of requests, which mean that the arriving
request and request under service are sent to a retrial pool. For a process of system states changing the embedded
Markov chain is built up. The theorem on non-ergodicity of Markov chain, which proves the instability of functioning of
the computer communication network managed by a random multiple access, is formulated.
request and request under service are sent to a retrial pool. For a process of system states changing the embedded
Markov chain is built up. The theorem on non-ergodicity of Markov chain, which proves the instability of functioning of
the computer communication network managed by a random multiple access, is formulated.
Keywords
About the authors
Anatoliy Andreevich Nazarov
Email: anazarov@fpmk.tsu.ru
Elena Aleksandrovna Sudyko
Email: Esudyko@yandex.ru
A A Nazarov
E A Sudyko
References
- Artalejo J. R., Dudin A. N., Klimenok V. I. Stationary analysis of a retrial queue with preemptive repeated attempts // Operations Research Letters. 2001. № 28(4). P. 173-180.
- Kernane T. Conditions for stability and instability of retrial queueing systems with general retrial times // Statistics and Probability Letters. 2008. № 78. P. 3244-3248.
- Sennot L. I., Humblet P. A., Tweedie R. L. Mean drifts and the non-ergodicity of Markov chains // Operations research. 1983. № 31(4). P. 783-789.
- Назаров А. А., Терпугов А. Ф. Теория массового обслуживания : учеб. пособие. Томск : Изд-во науч.- тех. лит., 2004.
Supplementary files
