A fundamental characterization of stability in broadcast queueing systems

Stability with respect to a given scheduling policy has become an important issue for wireless communication systems; but hard to prove in particular scenarios. In this paper two sufficient conditions for stability in a broadcast setting are derived, which are often very easy to check. Moreover, it is shown that if the given scheduling policy complies with both conditions the resulting throughput region of the policy equals the ergodic achievable rate region and the system is stable in a strong sense. This extends results presented in where the statement was shown for scheduling policies fulfilling so-called integrability condition. Additionally, in this paper we also present a partial converse to the statement which is demonstrated by an application example.