Deciding the FIFO stability of networks in polynomial time

Authors:
Maik Weinard
Affiliations:
Institut für Informatik, Johann Wolfgang Goethe–Universität Frankfurt am Main, Frankfurt am Main, Germany
Venue:
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Year:
2006

Citing 5
Cited 3

Adversarial queuing theory

Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols

Journal of the ACM (JACM)
Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model

FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
A Characterization of Universal Stability in the Adversarial Queuing Model

SIAM Journal on Computing
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

Stability of FIFO networks under adversarial models: State of the art

Computer Networks: The International Journal of Computer and Telecommunications Networking
The robustness of stability under link and node failures

Theoretical Computer Science
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

FIFO is the most prominent queueing strategy due to its simplicity and the fact that it only works with local information. Its analysis within the adversarial queueing theory however has shown, that there are networks that are not stable under the FIFO protocol, even at arbitrarily low rate. On the other hand there are networks that are universally stable, i.e., they are stable under every greedy protocol at any rate r The question as to which networks are stable under the FIFO protocol arises naturally. We offer the first polynomial time algorithm for deciding FIFO stability and simple-path FIFO stability of a directed network, answering an open question posed in [1, 4]. It turns out, that there are networks, that are FIFO stable but not universally stable, hence FIFO is not a worst case protocol in this sense. Our characterization of FIFO stability is constructive and disproves an open characterization in [4].