Survey of USSR contributions to random multiple-access communications

From MaRDI portal





The paper is a review of the principal results on random multiaccess (RMA) theory obtained in the USSR up to 1983. These results refer to a few areas as the stability (instability) conditions for ALOHA algorithms in single- or multihop networks, the RMA algorithms and their parameters and conflict resolution algorithms (CRA). In the analysis of the stability conditions the author presents ergodicity conditions for ALOHA systems described by ergodic Markov chains. Considering RMA algorithms, he gives different definitions of the RMA parameters, assuming discrete or continuous time Poisson input traffic. In the section, devoted to the CRA, he collects the main results on the stack algorithms for discrete time Poisson or non-Poisson traffic.











This page was built for publication: Survey of USSR contributions to random multiple-access communications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3715011)