Performance Evaluation for a Class of Algorithms of Random Multiple Access to a Radio-Communication Channel

We consider algorithms of random multiple access to a broadcast channel for which the probability to be transmitted in the nearest window is one and the same for all packets in the system. For such algorithms, we find a lower estimate for the packet queue length and upper estimate for the system capacity.