On the saturation rule for the stability of queues

This paper focuses on the stability of open queueing systems under stationary ergodic assumptions. It defines a set of conditions, the monotone separable framework, ensuring that the stability region is given by the following saturation rule : saturate the queues which are fed by the external arrival stream, look ate the intensity [??] of the departure stream in this saturated system, then stability holds whenever the intensity of the arrival process, say l satisfies the condition [??], whereas the network is unstable if [??]. Whenever the stability condition is satisfied, it is also shown that certain state variables associated with the network admit a finite stationary regime which is constructed pathwise using a Loynes type bacward argument. This framework involves two main pathwise properties, external monotonicity and separability, which are satisfied by several classical queueing networks. The main tool for the proof of this rule is sub-additive ergodic theory