Queueing analysis of slotted ALOHA with finite buffer capacity

In random multiple-access schemes, end users are usually modeled as “stations” with buffer capacity of one unit. Although it is, introduced for analytical conveniences, practically, buffer length of one unit is a rather restrictive limitation. In practice, a finite buffer capacity is needed so that stations can accept more than one unit. In the paper, the performance of slotted ALOHA with finite buffer capacity is analyzed. The study shows that the finite buffer capacity system yields a higher throughput and a lower rejection probability at low transmission probabilities if compared to the one unit buffer capacity system. However, the average packet delay of the finite buffer capacity system is higher than that of the one unit buffer capacity system