Delay analysis of the n-ary stack random-access algorithm

An analysis is presented of the delay performance of the n-ary stack algorithm, an easy-to-implement random-access algorithm that uses collision-no-collision binary feedback and requires only limited feedback sensing by the users. Utilizing the regenerative character of the stochastic processes that are associated with the random-access system, tight upper and lower bounds on the mean packet delay and on the packet delay variance are derived. It is shown that the algorithm with n=3 has the best delay characteristics. Simulation results for the percentiles of the packet delay distribution are given