|
Problemy Peredachi Informatsii, 1989, Volume 25, Issue 1, Pages 88–99
(Mi ppi642)
|
|
|
|
Communication Network Theory
Randomized and Nonrandomized Algorithms of Random Multiple Access
B. S. Tsybakov
Abstract:
For any randomized random multiple access algorithm with a Poisson input, we construct an equivalent nonrandomized algorithm with equal rate, delay time, and other parameters.
Citation:
B. S. Tsybakov, “Randomized and Nonrandomized Algorithms of Random Multiple Access”, Probl. Peredachi Inf., 25:1 (1989), 88–99; Problems Inform. Transmission, 25:1 (1989), 67–76
Linking options:
https://www.mathnet.ru/eng/ppi642 https://www.mathnet.ru/eng/ppi/v25/i1/p88
|
Statistics & downloads: |
Abstract page: | 320 | Full-text PDF : | 97 | First page: | 2 |
|