Anycasting in adversarial systems: Routing and admission control

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

Volumn 2719, Issue , 2003, Pages 1153-1168

  Awerbuch, Baruch ^a   Brinkmann, André ^b   Scheideler, Christian ^a  

^a Johns Hopkins University   (United States)

^b UNIVERSITY OF PADERBORN   (Germany)

Author keywords

Adversarial routing; Anycasting; Dynamic networks; Load balancing; Online algorithms

Indexed keywords

NETWORK MANAGEMENT; NETWORK ROUTING; RESOURCE ALLOCATION;

ADVERSARIAL ROUTING; ADVERSARIAL SYSTEM; ANYCAST ROUTING; ANYCASTING; DYNAMIC NETWORK; ON-LINE ALGORITHMS; OPTIMAL ALGORITHM; ROUTING PACKETS;

DYNAMIC ROUTING ALGORITHMS;

EID: 25144514330     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45061-0_88     Document Type: Article

References (18)

1. Y. Afek, B. Awerbuch, E. Gafni, Y. Mansour, A. Rosen, and N. Shavit. Slide - the key to polynomial end-to-end communication. Journal of Algorithms, 22(1):158-186, 1997.
2. Y. Afek and E. Gafni. End-to-end communication in unreliable networks. In PODC '88, pages 131-148, 1988.
3. W. Aiello, B. Awerbuch, B. Maggs, and S. Rao. Approximate load balancing on dynamic and synchronous networks. In STOC '93, pages 632-641, 1993.
4. W. Aiello, E. Kushilevitz, R. Ostrovsky, and A. Rosén. Adaptive packet routing for bursty adversarial traffic. In STOC '98, pages 359-368, 1998.
5. W. Aiello, R. Ostrovsky, E. Kushilevitz, and A. Rosén. Dynamic routing on networks with fixed-size buffers. In SODA '03, 2003.
6. M. Andrews, B. Awerbuch, A. Fernández, J. Kleinberg, T. Leighton, and Z. Liu. Universal stability results for greedy contention-resolution protocols. In FOCS '96, pages 380-389, 1996.
7. B. Awerbuch, P. Berenbrink, A. Brinkmann, and C. Scheideler. Simple routing strategies for adversarial systems. In FOCS '01, pages 158-167, 2001.
8. B. Awerbuch, A. Brinkmann, and C. Scheideler. Anycasting and multicasting in adversarial systems. Technical report, Dept. of Computer Science, Johns Hopkins University, March 2002. See http://www.cs.jhu.edu/∼scheideler.
9. B. Awerbuch and F. Leighton. A simple local-control approximation algorithm for multicommodity flow. In FOCS '93, pages 459-468, 1993.
10. B. Awerbuch and F. Leighton. Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks. In STOC '94, pages 487-496, 1994.
11. B. Awerbuch, Y. Mansour, and N. Shavit. End-to-end communication with polynomial overhead. In FOCS '89, pages 358-363, 1989.
12. A. Borodin, J. Kleinberg, P. Raghavan, M. Sudan, and D. P. Williamson. Adversarial queueing theory. In STOC '96, pages 376-385, 1996.
13. D. Gamarnik. Stability of adversarial queues via fluid models. In FOCS '98, pages 60-70, 1998.
14. D. Gamarnik. Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks. In STOC '99, pages 206-214, 1999.
15. A. Goel. Stability of networks and protocols in the adversarial queueing model for packet routing. In SODA '99, pages 911-912, 1999.
16. C. Partridge, T. Mendez, and W. Milliken. Rfc 1546: Host anycasting service, November 1993.
17. C. Scheideler and B. Vöcking. From static to dynamic routing: Efficient transformations of store-and-forward protocols. In STOC '99, pages 215-224, 1999.
18. P. Tsaparas. Stability in adversarial queueing theory. Master's thesis, Dept. of Computer Science, University of Toronto, 1997.