Abstruct-The stability of a queueing network with interdependent servers is considered. The dependency of servers is described by the definition of their subsets that can be activated simultaneously. Multihop packet radio networks (PRN's) provide a motivation for the consideration of this system. We study the problem of scheduling the server activation under the constraints imposed by the dependency among them. The performance criterion of a scheduling policy m is its throughput that is characterized by its stability region C,, that is, the set of vectors of arrival rates for which the system is stable. A policy m,, is obtained which is optimal in the sense that its stability region Cn0 is a superset of the stability region of every other scheduling policy. The stability region Cmo is characterized. Finally, we study the behavior of the network for arrival rates that lie outside the stability region. Implications of the results in certain types of concurrent database and parallel processing systems are discussed.
Reference REF shows that such a policy is throughput optimal, that is, it stabilizes any arrival vector L in the maximum throughput region-the set of 's for which the network is stabilized under some policy.
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks
IEEE Transactions on Automatic Control
Computer Science