The complexity of deciding stability under FFS in the Adversarial Queueing model

Information Processing Letters

Volumn 90, Issue 5, 2004, Pages 261-266

  Alvarez C ^a   Blesa, M ^a   Diaz J ^a   Fernandez A ^b   Serna, M ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSIDAD REY JUAN CARLOS   (Spain)

Author keywords

Adversarial Queueing Theory; Graph algorithms; Greedy scheduling protocols; Interconnection networks; Network stability; Packet switched interconnection networks

Indexed keywords

GRAPH THEORY; NETWORK PROTOCOLS; PACKET SWITCHING; POLYNOMIALS; QUEUEING NETWORKS; THEOREM PROVING;

ADVERSARIAL QUEUEING THEORY; GRAPH ALGORITHMS; GREEDY SCHEDULING PROTOCOLS; NETWORK STABILITY; PACKET SWITCHED INTERCONNECTION NETWORKS;

PACKET NETWORKS;

EID: 2142838462     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ipl.2004.02.016     Document Type: Article

References (5)

1. Àlvarez C., Blesa M., Serna M. Universal stability of undirected graphs in the adversarial queueing model. 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA'02), Winnipeg, Manitoba. 2002;183-197 ACM Press, New York.
2. C. Àlvarez, M. Blesa, M. Serna, A characterization of universal stability in the adversarial queueing model, SIAM J. Comput., in press.
3. Andrews M., Awerbuch B., Fernández A., Kleinberg J., Leighton T., Liu Z. Universal stability results for greedy contention-resolution protocols. J. ACM. 48:(1):2001;39-69.
4. Borodin A., Kleinberg J., Raghavan P., Sudan M., Williamson D. Adversarial queueing theory. J. ACM. 48:(1):2001;13-38.
5. Goel A. Stability of networks and protocols in the adversarial queueing model for packet routing. Networks. 37:(4):2001;219-224.