Abstract
We revisit the stability analysis of the well-known slotted Aloha protocol with a finite number of queues. Under standard modeling assumptions, we derive a sufficient condition for the stability by applying a positive recurrence criterion due to Rosberg (JAP, vol. 17, no. 3, 1980). Our sufficiency condition for stability is linear in arrival rates and does not require knowledge of the stationary joint statistics of queue lengths as has been the case in previous results. We also derive some sufficient conditions for instability of the protocol. We believe that the technique reported here could be useful in analyzing other stability problems in countable space Markovian settings.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
