Full Analysis of a Powerful Window Random Access Algorithm

摘要

A simple full sensing window random access algorithm is analyzed in the presence of the limit Poisson user model. The throughput of the algorithm is 0.43, and its delay and resistance to channel errors characteristics are superior to those induced by the Capetanakis window algorithm. In addition, the simple operations of the algorithm, in conjunction with its regenerative properties, allow for the computation and evaluation of the output traffic interdeparture distribution. The latter is needed in the evaluation of interacting systems which use the algorithm for their internal transmissions.