On delivery times in packet networks under adversarial traffic
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
The increase of the instability of networks due to Quasi-Static link capacities
Theoretical Computer Science
Stability of FIFO networks under adversarial models: State of the art
Computer Networks: The International Journal of Computer and Telecommunications Networking
Stability bounds in networks with dynamic link capacities
Information Processing Letters
Adversarial queuing theory with setups
Theoretical Computer Science
An experimental study of stability in heterogeneous networks
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Stability of the multiple-access channel under maximum broadcast loads
SSS'07 Proceedings of the 9h international conference on Stabilization, safety, and security of distributed systems
The robustness of stability under link and node failures
Theoretical Computer Science
Adversarial Queuing on the Multiple Access Channel
ACM Transactions on Algorithms (TALG)
Heterogenous networks can be unstable at arbitrarily low injection rates
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques
| Hi-index | 0.00 |
We consider the model of "adversarial queuing theory" for packet networks introduced by Borodin et al. [J. ACM, 48 (2001), pp. 13--38]. 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 less 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 less than 1/(d+1).