|
|
Problemy Peredachi Informatsii, 1985, Volume 21, Issue 2, Pages 69–89
(Mi ppi986)
|
|
|
|
Communication Network Theory
Some New Random Multiple-Access Algorithms
B. S. Tsybakov, N. B. Likhanov
Abstract:
The authors propose random multiple-access algorithms with rates all the way to 0.487, the algorithms being independent of the previous history. The delays and the coefficients of variability are calculated for algorithms of practical interest with initial delays on the order of one or two packet lengths, and rates in the range 0.419–0.475.
Received: 01.10.1984
Citation:
B. S. Tsybakov, N. B. Likhanov, “Some New Random Multiple-Access Algorithms”, Probl. Peredachi Inf., 21:2 (1985), 69–89; Problems Inform. Transmission, 21:2 (1985), 134–153
Linking options:
https://www.mathnet.ru/eng/ppi986 https://www.mathnet.ru/eng/ppi/v21/i2/p69
|
|