A characterization of universal stability in the adversarial queuing model

SIAM Journal on Computing

Volumn 34, Issue 1, 2005, Pages 41-66

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

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

Author keywords

Adversarial queueing theory; Graph algorithms; Greedy scheduling protocols; Interconnection networks; Network stability

Indexed keywords

ALGORITHMS; GRAPH THEORY; INTERCONNECTION NETWORKS; NETWORK PROTOCOLS; PACKET NETWORKS; POLYNOMIALS; QUEUEING NETWORKS;

ADVERSARIAL QUEUING THEORY; GRAPH ALGORITHMS; GREEDY SCHEDULING PROTOCOLS; NETWORK STABILITY;

MATHEMATICAL MODELS;

EID: 16244371748     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539703435522     Document Type: Article

References (19)

1. C. ÀLVAREZ, M. BLESA, J. DÍAZ, A. FERNÁNDEZ, AND M. SERNA, The complexity of deciding stability under FFS in the adversarial model, Inform. Process. Lett., 90 (2004), pp. 261-266.
2. C. ÀLVAREZ, M. BLESA, J. DÌAZ, A. FERNÁNDEZ, AND M. SERNA, Adversarial models for priority-based networks, in Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS'03), Bratislava, Slovakia, Lecture Notes in Comput. Sci. 2747, B. Rovan and P. Vojtas, eds. Springer-Verlag, Heidelberg, 2003, pp. 142-151.
3. M. ANDREWS, Instability of FIFO in session-oriented networks, J. Algorithms, 50 (2004), pp. 232-245.
4. M. ANDREWS, B. AWERBUCH, A. FERNÀNDEZ, J. KLEINBERG, T. LEIGHTON, AND Z. LIU, Universal-stability results for greedy contention-resolution protocols, J. ACM, 48 (2001), pp. 39-69.
5. R. BHATTACHARJEE AND A. GOEL, Instability of FIFO at arbitrarily low rates in the adversarial queueing model, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS'03), Cambridge, MA, IEEE Computer Society, Los Alamitos, CA, 2003, pp. 160-167.
6. A. BORODIN, J. KLEINBERG, P. RAGHAVAN, M. SUDAN, AND D. WILLIAMSON, Adversarial queueing theory, J. ACM, 48 (2001), pp. 13-38.
7. M. BRAMSON, Instability of FIFO queueing networks, Ann. Appl. Probab., 4 (1994), pp. 414-431.
8. R. CRUZ, A calculus for network delay. Part I: Network elements in isolation, IEEE Trans. Inform. Theory, 37 (1991), pp. 114-131.
9. R. CRUZ, A calculus for network delay. Part II: Network analysis, IEEE Trans. Inform. Theory, 37 (1991), pp. 132-141.
10. J. DÍAZ, D. KOUKOPOULOS, S. NIKOLETSEAS, M. SERNA, P. SPIRAKIS, AND D. THILIKOS, Stability and non-stability of the FIFO protocol, in Proceedings of the 13th annual ACM Symposium on Parallel Algorithms and Architectures (SPAA'01), Crete Island, Greece, 2001, pp. 48-52.
11. S. FORTUNE, J. HOPCROFT, AND J. WYLLIE, The directed subgraph homeomorphism problem, Theoret. Comput. Sci., 10 (1980), pp. 111-121.
12. D. GAMARNIK, Stability of adversarial queues via fluid models, in Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science (FOCS'98), Palo Alto, CA, 1998, pp. 60-70.
13. D. GAMARNIK. Stability of adaptive and nonadaptive packet routing policies in adversarial queueing networks, SIAM J. Comput., 32 (2003), pp. 371-385.
14. A. GOEL, Stability of networks and protocols in the adversarial queueing model for packet routing, Networks, 37 (2001), pp. 219-224.
15. D. KOUKOPOULOS, M. MAVRONICOLAS, S. NIKOLETSEAS, AND P. SPIRAKIS, On the stability of compositions of universally stable, greedy contention-resolution protocols, in Proceedings of the 16th International Symposium on Distributed Computing (DISC'02), Toulouse, France, Lecture Notes in Comput. Sci. 2508, D. Malkhi, ed., Springer, Berlin, 2002, pp. 88-102.
16. Z. LOTKER, B. PATT-SHAMIR, AND A. ROSEN, New stability results for adversarial queuing, SIAM J. Comput., 33 (2004), pp. 286-303.
17. N. ROBERTSON AND P. SEYMOUR, Graph minors. XIII. The disjoint paths problem, J. Combin. Theory Ser. B, 63 (1995), pp. 65-110.
18. A. ROSÉN, A note on models for non-probabilistic analysis of packet switching networks, Inform. Process. Lett., 84 (2002), pp. 237-240.
19. Z.-L. ZHANG, Z. DUAN, AND Y. HOU, Fundamental trade-offs in aggregate packet scheduling, in IEEE 9th International Conference on Network Protocols (ICNP'01), Riverside, CA, IEEE Computer Society, Washington, DC, 2001, pp. 129-137.