The complexity of deciding stability under FFS in the adversarial queueing model

Authors:
C. Àlvarez;M. Blesa;J. Díaz;A. Fernández;M. Serna
Affiliations:
Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya Campus Nord, E-08034 Barcelona, Spain;Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya Campus Nord, E-08034 Barcelona, Spain;Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya Campus Nord, E-08034 Barcelona, Spain;Grupo de Sistemas y Comunicaciones, Universidad Rey Juan Carlos, Campus de Mostoles, E-28933 Madrid, Spain;Dept. Llenguatges i Sistemes Informàtics, Universitat Politècnica de Catalunya Campus Nord, E-08034 Barcelona, Spain
Venue:
Information Processing Letters
Year:
2004

Citing 4
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)
Universal stability of undirected graphs in the adversarial queueing model

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
A Characterization of Universal Stability in the Adversarial Queuing Model

SIAM Journal on Computing

Optimal algorithms for detecting network stability

WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
The robustness of stability under link and node failures

Theoretical 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

Quantified Score

Hi-index	0.89

Visualization

Abstract

We address the problem of deciding whether a given network is stable in the Adversarial Queueing Model when considering farthest-from-source (FFS) as the queueing policy to schedule the packets through its links. We show a characterisation of the networks which are stable under FFS in terms of a family of forbidden subgraphs. We show that the set of networks stable under FFS coincide with the set of universally stable networks. Since universal stability of networks can be checked in polynomial time, we obtain that stability under FFS can also be decided in polynomial time.