Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model

Authors:
Rajat Bhattacharjee;Ashish Goel;Zvi Lotker
Affiliations:
-;-;-
Venue:
SIAM Journal on Computing
Year:
2005

Citing 0
Cited 12

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
The Effects of Local Randomness in the Adversarial Queueing Model

ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Adversarial queuing theory with setups

Theoretical Computer Science
Instability of FIFO in the permanent sessions model at arbitrarily small network loads

ACM Transactions on Algorithms (TALG)
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)
Adversarial queueing model for continuous network dynamics

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Deciding stability in packet-switched FIFO networks under the adversarial queuing model in polynomial time

DISC'05 Proceedings of the 19th international conference on Distributed Computing
Instability of FIFO in a simple queueing system with arbitrarily low loads

Operations Research Letters
Simulation of adversarial scenarios in OMNeT++: putting adversarial queueing theory from its head to feet

Proceedings of the 6th International ICST Conference on Simulation Tools and Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 $r$, we use a network of size $\tilde{O}(1/r)$.