RUS  ENG
Full version
JOURNALS // Problemy Peredachi Informatsii // Archive

Probl. Peredachi Inf., 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.

UDC: 621.394.74:62-507

Received: 01.10.1984


 English version:
Problems of Information Transmission, 1985, 21:2, 134–153

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024