Survey of USSR contributions to random multiple-access communications

DOI10.1109/TIT.1985.1057023zbMath0587.94002OpenAlexW2135813625MaRDI QIDQ3715011

B. S. Tsybakov

Publication date: 1985

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tit.1985.1057023

zbMATH Keywords

stabilityergodicityPoisson processesergodic Markov chainsstack algorithmsRMA algorithmsconflict resolution algorithmsALOHA systemspacket radio networksALOHA algorithms

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Research exposition (monographs, survey articles) pertaining to information and communication theory (94-02) Information theory (general) (94A15) Point processes (e.g., Poisson, Cox, Hawkes processes) (60G55) Communication theory (94A05)

Related Items

A unified minimum-search method for resolving contentions in multiaccess networks with ternary feedback, Random multiple access in a vector disjunctive channel, Mathematical theory of queueing networks, A stack protocol of CTM type with quartet feedback, Interrelation of characteristics of blocked RMA stack algorithms, Optimal channel utilization with limited feedback