Abstract

We have extended our previous studies (2000) of the system stability of buffered ALOHA systems to study an individual queue's stability, i.e., per-queue stability. The main result obtained in this work is a necessary and sufficient per-queue stability condition, which can be computed analytically only for several cases. For other incomputable cases, we evaluated several inner and outer bounds. They are generally quite tight for not-so-asymmetric systems.

Full Text
Paper version not known

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 call

Disclaimer: 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.