|
Problemy Peredachi Informatsii, 2010, Volume 46, Issue 1, Pages 94–111
(Mi ppi2011)
|
|
|
|
This article is cited in 14 scientific papers (total in 14 papers)
Communication Network Theory
Method of asymptotic semiinvariants for studying a mathematical model of a random access network
A. A. Nazarov, E. A. Sudyko Tomsk State University
Abstract:
To study a mathematical model of a random access network with a finite number of sources, retrials, and a conflict warning stage, we propose a method of asymptotic semiinvariants under a growing number of sources, which allows us to find the asymptotic probability distribution of the number of requests in a retrial pool. We present results of numerical implementation of a prelimit distribution of the number of requests in the retrial pool. We compare the prelimit and asymptotic semiinvariants.
Received: 25.06.2009 Revised: 07.12.2009
Citation:
A. A. Nazarov, E. A. Sudyko, “Method of asymptotic semiinvariants for studying a mathematical model of a random access network”, Probl. Peredachi Inf., 46:1 (2010), 94–111; Problems Inform. Transmission, 46:1 (2010), 86–102
Linking options:
https://www.mathnet.ru/eng/ppi2011 https://www.mathnet.ru/eng/ppi/v46/i1/p94
|
Statistics & downloads: |
Abstract page: | 1022 | Full-text PDF : | 138 | References: | 59 | First page: | 14 |
|