Universal stability of undirected graphs in the adversarial queueing model

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2002, Pages 183-191

  Àlvarez, Carme ^a   Blesa, Maria ^a   Serna, Maria ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Adversarial queueing; Greedy protocols; Network stability; Packet switched networks

Indexed keywords

COMPUTER SIMULATION; GRAPH THEORY; NETWORK PROTOCOLS; PACKET NETWORKS; PACKET SWITCHING; QUEUEING THEORY;

ADVERSARIAL QUEUEING MODEL; GREEDY PROTOCOLS; NETWORK STABILITY; UNDIRECTED GRAPHS;

ALGORITHMS;

EID: 0036948868     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/564902.564903     Document Type: Conference Paper

References (8)

1. C. Àlvarez, M. Blesa, and M. Serna. A characterization of universal stability for directed graphs in the adversarial queueing model. Technical report LSI-02-4-R, Dept. Llenguatges i Sistemes Informàtics; Universitat Politècnica de Catalunya, 2002.
2. M. Andrews, B. Awerbuch, A. Fernández, J. Kleinberg, T. Leighton, and Z. Liu. Universal stability results for greedy contention-resolution protocols. Journal of the ACM, 48(1):39-69, 2001. Earliest version at FOCS'96, pp. 380-389.
3. A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. Williamson. Adversarial queueing theory. Journal of the ACM, 48(1):13-38, 2001. Earliest version at STOC'96, pp. 376-385.
4. J. Diaz, D. Koukopoulos, S. Nikoletseas, M. Serna, P. Spirakis, and D. Thilikós. Stability and non-Stability of the FIFO Protocol. In 13th annual ACM Symposium on Parallel Algorithms and Architectures, pages 48-52, Crete Island, Greece, July 2001.
5. S. Fortune, J. Hopcroft, and J. Wyllie. The directed subgraph homeomorphism problem. Theoretical Computer Science, 10:111-121, 1980.
6. D. Gamarnik. Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks. In 31st. Annual ACM Symposium on Theory of Computing, pages 206-214, Atlanta, Georgia, USA, May 1999.
7. A. Goel. Stability of networks and protocols in the adversarial queueing model for packet routing. Networks, 37(4):219-224, 2001.
8. N. Robertson and P. Seymour. Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory. Series B, 63(1):65-110, 1995.