Packet Switching in Radio Channels: New Conflict-Free Multiple Access Schemes

We study new access schemes for a population of geographically distributed data users who communicate with each other and/or with a central station over a multiple-access broadcast ground radio packet-switching channel. We introduce and analyze alternating priorities (AP), round robin (RR), and random order (RO) as new conflict-free methods for multiplexing buffered users without control from a central station. These methods are effective when the number of users is not too large; as the number grows, a large overhead leads to a performance degradation. To reduce this degradation, we consider a natural extension of AP, called minislotted alternating priorities (MSAP) which reduces the overhead and is superior to fixed assignment, polling, and known random access schemes under heavy traffic conditions. At light input loads, only random access schemes outperform MSAP when we have a large population of users. In addition, and of major importance, is the fact that MSAP does not require control from a central station.

[1]  Alan Cobham,et al.  Priority Assignment in Waiting Line Problems , 1954, Oper. Res..

[2]  Sarah Williams,et al.  Computer applications , 1988 .

[3]  L. Takacs.  Delay distributions for one line with poisson input, general holding times, and various orders of service , 1963 .

[4]  Peter D. Welch,et al.  On a Generalized M/G/1 Queuing Process in Which the First Customer of Each Busy Period Receives Exceptional Service , 1964 .

[5]  L. Kleinrock.  A conservation law for a wide class of queueing disciplines , 1965 .

[6]  P. E. Jackson,et al.  A study of multiaccess computer communications , 1969, AFIPS '69 (Spring).

[7]  James Martin,et al.  Teleprocessing Network Organization , 1969 .

[8]  Norman M. Abramson,et al.  THE ALOHA SYSTEM: another alternative for computer communications , 1899, AFIPS '70 (Fall).

[9]  Linus Schrage.  Letter to the Editor - An Alternative Proof of a Conservation Law for the Queue G/G/1 , 1970, Oper. Res..

[10]  J. Spragins.  Loop Transmission Systems - Mean Value Analysis , 1972, IEEE Transactions on Communications.

[11]  Wushow Chou,et al.  Topological optimization of computer networks , 1972 .

[12]  Lawrence G. Roberts,et al.  Dynamic allocation of satellite capacity through packet reservation , 1973, AFIPS National Computer Conference.

[13]  L. G. Roberts,et al.  Computer report III: Data by the packet: Because computing costs are now so low, an unusual new concept of data communications is feasible , 1974, IEEE Spectrum.

[14]  Bernd Meister,et al.  Waiting Lines and Times in a System with Polling , 1974, JACM.

[15]  Simon S. Lam,et al.  Packet Switching In A Multi-Access Broadcast Channel With Application To Satellite Communication In A Computer Network , 1974 .

[16]  Leonard Kleinrock,et al.  Packet Switching in a Multiaccess Broadcast Channel: Performance Evaluation , 1975, IEEE Trans. Commun..

[17]  Fouad A. Tobagi,et al.  Random access techniques for data transmission over packet-switched radio channels , 1975, AFIPS '75.

[18]  L. Kleinrock,et al.  Packet Switching in Radio Channels: Part I - Carrier Sense Multiple-Access Modes and Their Throughput-Delay Characteristics , 1975, IEEE Transactions on Communications.

[19]  Robert E. Kahn,et al.  The organization of computer resources into a packet radio network , 1899, AFIPS '75.

[20]  Lawrence G. Roberts,et al.  ALOHA packet system with and without slots and capture , 1975, CCRV.

[21]  L. Kleinrock,et al.  Packet Switching in Radio Channels: Part III - Polling and (Dynamic) Split-Channel Reservation Multiple Access , 1976, IEEE Transactions on Communications.

[22]  L. Kleinrock,et al.  Packet Switching in Radio Channels: Part IV - Stability Considerations and Dynamic Control in Carrier Sense Multiple Access , 1977, IEEE Transactions on Communications.

[23]  Leonard Kleinrock,et al.  Performance of Distributed Multi-Access Computer-Communication Systems , 1977, IFIP Congress.