Per-queue stability analysis of a random access system

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.