论文信息 - Bounds for Queue Lengths in a Contention Packet Broadcast System

Bounds for Queue Lengths in a Contention Packet Broadcast System

A finite number of users communicating through a broadcast channel is considered. Each user has a buffer of infinite capacity, and a user randomly accesses the channel (ALOHA-type protocol). Moreover, only one packet per user might be sent in an access time. Both symmetric and asymmetric models are considered; that is, we assume either indistinguishable or distinguishable users. An exact analysis of the queue lengths in that type of system is not now available, and therefore, based on some algebraic studies, we shall present some lower and some upper bounds for the average queue lengths. These bounds are quite tight for a small number of users and acceptable for a wide range of input parameters in the symmetric case. In the asymmetric case the bounds are acceptable only for light input traffic and a small number of users.

Wojciech Szpankowski

[1] Wojciech Szpankowski,et al. Stability Conditions for Multidimensional Queueing Systems and Applications to Analysis of Computer Systems , 1986 .

[2] Anthony Ephremides,et al. Analysis, stability, and optimization of slotted ALOHA with a finite number of buffered users , 1980 .

[3] Moshe Sidi,et al. Structured priority queueing systems with applications to packet-radio networks , 1983, Perform. Evaluation.

[4] Moshe Sidi,et al. Two Interfering Queues in Packet-Radio Networks , 1983, IEEE Trans. Commun..

[5] Fouad A. Tobagi,et al. Multiaccess Protocols in Packet Communication Systems , 1980, IEEE Trans. Commun..

[6] Mart Lauri Molle. UNificatins and Extensions of the Multiple Access Communications Problem , 1981 .

[7] Wojciech Szpankowski,et al. Ergodicity aspects of multidimensional Markov chains with application to computer communication system analysis , 1984 .

[8] Hideaki Takagi,et al. Abstracts of research reportAnalysis of throughput and delay for single- and multi-hop packet radio networks☆ , 1985 .

[9] Zvi Rosberg. Bounds for the Optimal Decentralized Access Protocol in a Local Area Network , 1986, Perform. Evaluation.

[10] A. Ephremides,et al. Analysis, stability, and optimization of slotted ALOHA with a finite number of buffered users , 1980, 1980 19th IEEE Conference on Decision and Control including the Symposium on Adaptive Processes.