Accession Number : ADA130785

Title :   UNificatins and Extensions of the Multiple Access Communications Problem,

Corporate Author : CALIFORNIA UNIV LOS ANGELES DEPT OF COMPUTER SCIENCE

Personal Author(s) : Molle,Mart Lauri

PDF Url : ADA130785

Report Date : Jul 1981

Pagination or Media Count : 140

Abstract : Multiple access protocols permit a broadcast communications channel to be shared by a large number of stations under distributed control. It is assumed that only one message at a time can be transmitted successfully over the common channel. The author derives a local optimality condition for synchronous multiple access protocols, and show that many known protocols are special cases of this condition. Included a survey of much of the recent work on infinite population tree algorithms that use the history of channel activity to carry out short-range dynamic scheduling. A novel approach is presented for deriving upper bounds on the maximum stable throughput with finite average delay for infinite population protocols. Bounds are found for the case of arbitrarily complex algorithms, and for the restricted (but reasonable) class of protocols that obey a degenerate intersection property. This latter class is quite interesting, being a slight generalization of first-come first-served that includes all currently proposed protocols. The model is extended to include multiple access protocols aided by a partial reservation channel. Particular emphasis is placed on multiple access in the context of local networks.

Descriptors :   *Multiple access, *Communications networks, *Numerical methods and procedures, Radio broadcasting, Data transmission systems, Message processing, Scheduling, Throughput, Algorithms, Optimization, Population

Subject Categories : Theoretical Mathematics
      Non-radio Communications

Distribution Statement : APPROVED FOR PUBLIC RELEASE