Universal stability of undirected graphs in the adversarial queueing model

Authors:
Carme Àlvarez;Maria Blesa;Maria Serna
Affiliations:
Universitat Politècnica Catalunya, Barcelona;Universitat Politècnica Catalunya, Barcelona;Universitat Politècnica Catalunya, Barcelona
Venue:
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Year:
2002

Citing 5
Cited 4

Graph minors. XIII: the disjoint paths problem

Journal of Combinatorial Theory Series B
Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
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

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

Information Processing Letters
On delivery times in packet networks under adversarial traffic

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Tight bounds for the performance of longest in system on DAGs

Journal of Algorithms
The impact of network structure on the stability of greedy protocols

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the universal stability of undirected graphs in the adversarial queueing model for packet routing. In this setting, packets must be injected in some edge and have to traverse a path before leaving the system. Restrictions on the allowed types of path that packets must traverse provide different packet models. We consider three natural models, and provide polynomial time algorithms for testing universal stability on them. In the three cases, we obtain a different characterization, in terms of forbidden subgraphs, thus showing that slight variations lead to non-equivalent models.We extend those results to show that universal stability of digraphs, in the case in which packets follow directed paths without repeating vertices, can be decided in polynomial time.All the instability results are obtained for the \NTGLIS protocol. Therefore, the property of universal stability is equivalent to \NTGLIS-stability, in all the cases.