On the stability of compositions of universally stable, greedy contention-resolution protocols

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2508, Issue , 2002, Pages 88-102

  Koukopoulos, D ^a   Mavronicolas, M ^b   Nikoletseas, S ^a   Spirakis, P ^a  

^a University of Patras and Computer Technology Institute   (Greece)

^b UNIVERSITY OF CYPRUS   (Cyprus)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; PACKET SWITCHING; STABILITY;

CONTENTION RESOLUTION PROTOCOLS; DISTRIBUTED COMPUTATIONS; LARGE SCALE PLATFORMS; LONGEST IN SYSTEMS; PACKET-SWITCHED COMMUNICATION NETWORKS; PERFORMANCE PROPERTIES; STABILITY PROPERTIES; UNIVERSAL STABILITY;

INTERNET PROTOCOLS;

EID: 84947207411     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36108-1_6     Document Type: Conference Paper

References (12)

1. M. Andrews, B. Awerbuch, A. Fernandez, J. Kleinberg, T. Leighton, and Z. Liu, “Universal Stability Results for Greedy Contention-Resolution Protocols,” Journal ofthe ACM, Vol. 48, No. 1, pp. 39–69, January 2001.
2. M. Andrews, A. Férnandez, A. Goel and L. Zhang, “Source Routing and Scheduling in Packet Networks,” Proceedings ofthe 42nd Annual IEEE Symposium on Foundations ofComputer Science, pp. 168–177, October 2002.
3. A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan and D. Williamson, “Adversarial Queueing Theory,” Journal ofthe ACM, Vol. 48, No. 1, pp. 13–38, January 2001.
4. H. Chen and D. D. Yao, Fundamentals of Queueing Networks, Springer, 2000.
5. J. Diaz, D. Koukopoulos, S. Nikoletseas, M. Serna, P. Spirakis and D. Thilikos, “Stability and Non-Stability of the FIFO Protocol,” Proceedings ofthe 13th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 48–52, July 2001.
6. A. Férnandez, E. Jiménez and V. Cholvi, “On the Interconnection of Causal Memory Systems,” Proceedings ofthe 19th Annual ACM Symposium on Principles of Distributed Computing, pp. 163–170, July 2000.
7. S. Floyd and V. Paxson, “Difficulties in Simulating the Internet,” IEEE/ACM Transactions on Networking, Vol. 9, No. 4, pp. 392–403, August 2001.
8. A. Goel, “Stability of Networks and Protocols in the Adversarial Queueing Model for Packet Routing,” Networks, Vol. 37, No. 4, pp. 219-224, 2001.
9. M. P. Herlihy and J. Wing, “Linearizability: A Correctness Condition for Concurrent Objects,” ACM Transactions on Programming Languages and Systems, Vol. 12, No. 3, pp. 463–492, 1990.
10. N. Lynch, Distributed Algorithms, Morgan Kaufmann, 1996.
11. J. Mitchell, Email Communication to I. Lee, April 2002.
12. P. Tsaparas, Stability in Adversarial Queueing Theory, M.Sc. Thesis. Department of Computer Science, University of Toronto, 1997.