Unified Method for Delay Analysis of Random Multiple Access Algorithms

摘要

This paper presents a unified method for the delay analysis of a large class of random multiple-access algorithms. This method is based on a powerful theorem referring to regenerative processes, in conjunction with results from the theory of infinite dimensionality linear systems. The authors apply the method to analyze and compute the per packet expected delays induced by two algorithms, in the presence of the Poisson user model. The considered algorithms are: The controlled ALOHA algorithm, and the 0.487 algorithm. The same method has been previously applied, for the delay analysis of certain limited sensing random access algorithms. Keywords: communications networks; allocations. (Author)