|
Problemy Peredachi Informatsii, 1990, Volume 26, Issue 4, Pages 83–98
(Mi ppi631)
|
|
|
|
This article is cited in 5 scientific papers (total in 5 papers)
Communication Network Theory
Random Multiple Access in Binary Feedback Channel
B. S. Tsybakov, A. N. Beloyarov
Abstract:
We consider random multiple access algorithms of packets to a channel with “empty-not empty” (E – NE) and “success-no success” (S – NS) binary feedback. Upper bounds on mean packet delays are determined for these algorithms.
Received: 12.09.1989
Citation:
B. S. Tsybakov, A. N. Beloyarov, “Random Multiple Access in Binary Feedback Channel”, Probl. Peredachi Inf., 26:4 (1990), 83–98; Problems Inform. Transmission, 26:4 (1990), 354–366
Linking options:
https://www.mathnet.ru/eng/ppi631 https://www.mathnet.ru/eng/ppi/v26/i4/p83
|
Statistics & downloads: |
Abstract page: | 323 | Full-text PDF : | 120 | First page: | 2 |
|