We consider the model of "adversarial queuing theory" for packet networks introduced by Borodin et al. . We show that the scheduling protocol First-In-First-Out (FIFO) can be unstable at any injection rate larger than 1/2, and that it is always stable if the injection rate is no more than 1/d, where d is the length of the longest route used by any packet. We further show that every work-conserving (i.e., greedy) scheduling policy is stable if the injection rate is no more than 1/(d+1).
|Number of pages||8|
|State||Published - 2002|
|Event||Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures - Winnipeg, MAN., Canada|
Duration: 10 Aug 2002 → 13 Aug 2002
|Conference||Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures|
|Period||10/08/02 → 13/08/02|
- Adversarial queuing theory