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: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Mathematical Statistics,
2012-09-10T19:09:26Z.
|
| Subjects: | |
| Online Access: | Get fulltext |