Stability of N interacting queues in random-access systems
- 1 July 1999
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 45 (5) , 1579-1587
- https://doi.org/10.1109/18.771161
Abstract
We revisit the stability problem of systems consisting of N buffered terminals accessing a common receiver over the collision channel by means of the standard ALOHA protocol. We find that in the slotted ALOHA system queues have "instability rank" based on their individual average arrival rates and transmission probabilities. If a queue is stable, then the queue with lower instability rank is stable as well. The instability rank is used to intelligently set up the dominant systems. And the stability inner and outer bounds can be found by bounding the idle probability of some queues in the dominant system. Through analyzing those dominant systems one by one, we are able to obtain inner and outer bounds for stability. These bounds are tighter than the known ones although they still fail to identify the exact stability region for cases of N>2. The methodology used is new and holds promise for successfully addressing other similar stability problems.Keywords
This publication has 6 references indexed in Scilit:
- Stability conditions for some distributed systems: buffered random access systemsAdvances in Applied Probability, 1994
- The stability region of the finite-user slotted ALOHA protocolIEEE Transactions on Information Theory, 1991
- On the stability of interacting queues in a multiple-access systemIEEE Transactions on Information Theory, 1988
- Packet switching with satellitesPublished by Association for Computing Machinery (ACM) ,1973
- THE ALOHA SYSTEMPublished by Association for Computing Machinery (ACM) ,1970
- The stability of a queue with non-independent inter-arrival and service timesMathematical Proceedings of the Cambridge Philosophical Society, 1962