Randomized and nonrandomized algorithms of random multiple access (Q753784)

The paper concerns the randomized (R) and nonrandomized (NR) random multiple access algorithms. The author defines these two classes of random access protocols taking into account the probability p, that a packet is sent over a channel in the current slot. The analysis is restricted to systems with Poisson input streams. Under this condition the author constructs, for any R-algorithm an equivalent NR-algorithm with the same rate, delay time and other parameters. Furthermore he determines R-and NR-algorithms that are optimal in the sense of the maximum rate. It has been shown that for a Poisson input stream, any upper bounds for the rate of the optimal NR-algorithms are also upper bounds for the rate of the optimal R-algorithms. Examples of representation of some known R-algorithms in an NR-form are also given.