A Random Multiple Access Algorithm with Finite Stack and Packet Loss

The performance analysis of a random multiple access algorithm with finite stack is developed. Packets that come out of the stack are considered to be lost for the system. The throughput and the delay of successfully transmitted packets are obtained. It is shown how the algorithm characteristics depend on the stack size. The results obtained can be used in the design of communication systems with random multiple access of users to a shared channel.