On delivery times in packet networks under adversarial traffic
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Underload instabilities in packet networks with flow schedulers
IEEE/ACM Transactions on Networking (TON)
Performance and stability bounds for dynamic networks
Journal of Parallel and Distributed Computing
An experimental study of stability in heterogeneous networks
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
Deciding the FIFO stability of networks in polynomial time
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
The necessity of timekeeping in adversarial queueing
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Hi-index | 0.00 |
We study the stability of the commonly used packet forwarding protocol, FIFO (First In First Out), in the adversarial queueing model. We prove that FIFO can become unstable, i.e., lead to unbounded buffer-occupancies and queueing delays, at arbitrarily low injection rates. In order to demonstrate instability at rate 驴 we use a network of size polynomial in 1/驴.