Randomized Scheduling Algorithm for Queueing Networks
There has recently been considerable interest in design of low-complexity, myopic, distributed and stable scheduling algorithms for constrained queueing network models that arise in the context of emerging communication networks. Here we consider two representative models. One, a queueing network mo...
| Main Authors: | , |
|---|---|
| 其他作者: | |
| 格式: | Article |
| 語言: | en_US |
| 出版: |
Institute of Mathematical Statistics
2012
|
| 在線閱讀: | http://hdl.handle.net/1721.1/72602 https://orcid.org/0000-0003-0737-3259 |