Bounds for Queue Lengths in a Contention Packet Broadcast System
- 1 November 1986
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 34 (11) , 1132-1140
- https://doi.org/10.1109/tcom.1986.1096465
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- Ergodicity aspects of multidimensional Markov chains with application to computer communication system analysisPublished by Springer Nature ,2006
- Bounds for the optimal decentralized access protocol in a local area networkComputer Compacts, 1986
- Structured priority queueing systems with applications to packet-radio networksPerformance Evaluation, 1983
- Two Interfering Queues in Packet-Radio NetworksIEEE Transactions on Communications, 1983
- Analysis, stability, and optimization of slotted ALOHA with a finite number of buffered usersIEEE Transactions on Automatic Control, 1981
- Multiaccess Protocols in Packet Communication SystemsIEEE Transactions on Communications, 1980