|
|
Problemy Peredachi Informatsii, 1980, Volume 16, Issue 3, Pages 80–94
(Mi ppi1452)
|
|
|
|
Communication-Network Theory and Large System Science
Random Multiple-Access Stack Algorithm
B. S. Tsybakov, N. D. Vvedenskaya
Abstract:
The article proposes an easy-to-implement algorithm for random multiple access of packets to a broadcast channel. The algorithm requires that the transmitting/receiving station follow the state of the channel only in the period from the instant of sending its packet until its successful transmission. It is shown that the algorithm results in finite average delays for transmission at rates less than 0.384. Results of simulation of the access system are given.
Received: 22.01.1980
Citation:
B. S. Tsybakov, N. D. Vvedenskaya, “Random Multiple-Access Stack Algorithm”, Probl. Peredachi Inf., 16:3 (1980), 80–94; Problems Inform. Transmission, 16:3 (1980), 230–243
Linking options:
https://www.mathnet.ru/eng/ppi1452 https://www.mathnet.ru/eng/ppi/v16/i3/p80
|
| Statistics & downloads: |
| Abstract page: | 639 | | Full-text PDF : | 319 |
|