On Queueing Problems in Random-Access Communications

Abstract

The general problem of allocating the capacity of a communication channel to a population of geographically distributed terminals is considered. The main focus is on the queueing problems that arise in the analysis of random access resolution algorithms. The performance measures of interest are the channel efficiency and the mean response time. The nature of known solutions for various random access schemes is discussed and a lower bound for the mean response time is conjectured. Copyright © 1985 by The Institute of Electrical and Electronics Engineers, Inc.