DMCA
Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks (1992)
| Venue: | IEEE Transactions on Automatic Control |
| Citations: | 949 - 19 self |
BibTeX
@ARTICLE{Tassiulas92stabilityproperties,
author = {Ros Tassiulas and Anthony Ephremides},
title = {Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks},
journal = {IEEE Transactions on Automatic Control},
year = {1992},
pages = {36--1936}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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. I.
Keyphrases
maximum throughput stability region stability property multihop radio network scheduling policy arrival rate queueing network stability region cmo performance criterion stability region cn0 parallel processing system interdependent server certain type concurrent database abstruct-the stability server activation multihop packet radio network
