Deciding stability in packet-switched FIFO networks under the adversarial queuing model in polynomial time

Authors:
Maria J. Blesa
Affiliations:
ALBCOM Research Group, Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya, Barcelona, Spain
Venue:
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Year:
2005

Citing 10
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)
Stability and non-stability of the FIFO protocol

Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Stability Issues in Heterogeneous and FIFO Networks under the Adversarial Queueing Model

HiPC '01 Proceedings of the 8th International Conference on High Performance Computing
New Stability Results for Adversarial Queuing

SIAM Journal on Computing
The complexity of deciding stability under FFS in the adversarial queueing model

Information Processing Letters
A Characterization of Universal Stability in the Adversarial Queuing Model

SIAM Journal on Computing
Instability of FIFO at Arbitrarily Low Rates in the Adversarial Queueing Model

SIAM Journal on Computing
Adversarial models for priority-based networks

Networks
Stability behavior of FIFO protocol in the adversarial queuing model

PCI'01 Proceedings of the 8th Panhellenic conference on Informatics

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

Computer Networks: The International Journal of Computer and Telecommunications Networking
Optimal algorithms for detecting network stability

WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Deciding the FIFO stability of networks in polynomial time

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

In spite of the importance of the fifo protocol and the research efforts invested in obtaining results for it, deciding whether a given (packet-switched) network is stable under fifo has remained an open question for several years. In this work, we address the general case of this problem and try to characterize the property of stability under fifo in terms of network topologies. Such a characterization provides us with the family of network topologies that, under the fifo protocol, can be made unstable by some adversarial traffic pattern. We show that the property of stability under fifo is decidable in polynomial time.