Analysis of a stack algorithm for random multiple-access communication

The present investigation is concerned with the performance of a protocol for managing the use of a single-channel packet switching communications network such as the one employed in the Aloha network. The conducted analysis is mainly concerned with the Capetanakis-Tsybakov-Mikhailov (CTM) access protocols and collision resolution algorithms (CRA), coupled with free, or continuous, access of newly arriving packets into the contention. The considered scheme proves ergodic as long as the rate of generation of new packets is below a certain bound. Attention is given to the basic equation and the collision resolution interval (CRI) duration, the direct evaluation of the mean delay, the distribution of the states of the top of stack, the moments of packet delay time, and the numerical results.