Survey on oblivious routing strategies

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

Volumn 5635 LNCS, Issue , 2009, Pages 419-429

  Räcke, Harald ^a  

^a UNIVERSITY OF WARWICK   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

DISTRIBUTED ENVIRONMENTS; OBLIVIOUS ROUTING; ROUTING DECISIONS; ROUTING PATH; TRAFFIC PATTERN;

ROUTING ALGORITHMS; SURVEYS;

COMPUTATION THEORY;

EID: 76249099406     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03073-4_43     Document Type: Conference Paper

References (30)

1. Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.S.: A general approach to online network optimization problems. In: Proc. of the 15th SODA, pp. 577-586 (2004)
2. Azar, Y., Cohen, E., Fiat, A., Kaplan, H., Räcke, H.: Optimal oblivious routing in polynomial time. In: Proc. of the 35th STOC, pp. 383-388 (2003)
3. Bartal, Y.: Probabilistic approximations of metric spaces and its algorithmic applications. In: Proc. of the 37th FOCS, pp. 184-193 (1996)
4. Bartal, Y.: On approximating arbitrary metrics by tree metrics. In: Proc. of the 30th STOC, pp. 161-168 (1998)
5. Bartal, Y., Leonardi, S.: On-line routing in all-optical networks. Theor. Com-put. Sci. 221(1-2), 19-39 (1999);
6. Also In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol. 1256, pp. 516-526. Springer, Heidelberg (1997)
7. Bienkowski, M., Korzeniowski, M., Räcke, H.: A practical algorithm for constructing oblivious routing schemes. In: Proc. of the 15th SPAA, pp. 24-33 (2003)
8. Borodin, A., Hopcroft, J.E.: Routing, merging and sorting on parallel models of computation. J. Comput. Syst. Sci. 30(1), 130-145 (1985)
9. Busch, C., Magdon-Ismail, M., Xi, J.: Oblivious routing on geometric networks. In: Proc. of the 17th SPAA, pp. 316-324 (2005)
10. Busch, C., Magdon-Ismail, M., Xi, J.: Optimal oblivious path selection on the mesh. In: Proc. of the 20th IPDPS, pp. 82-91 (2005)
11. Charikar, M., Chekuri, C., Goel, A., Guha, S., Plotkin, S.A.: Approximating a finite metric by a small number of tree metrics. In: Proc. of the 39th FOCS, pp. 379-388 (1998)
12. Chekuri, C., Khanna, S., Shepherd, B.: The all-or-nothing multicommodity flow problem. In: Proc. of the 36th STOC, pp. 156-165 (2004)
13. Fakcharoenphol, J., Rao, S.B., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proc. of the 35th STOC, pp. 448-455 (2003)
14. Harrelson, C., Hildrum, K., Rao, S.B.: A polynomial-time tree decomposition to minimize congestion. In: Proc. of the 15th SPAA, pp. 34-43 (2003)
15. Harsha, P., Hayes, T.P., Narayanan, H., Racke, H., Radhakrishnan, J.: Minimizing average latency in oblivious routing. In: Proc. of the 19th SODA, pp. 200-207 (2008)
16. Kaklamanis, C., Krizanc, D., Tsantilas, T.: Tight bounds for oblivious routing in the hypercube. In: Proc. of the 2nd SPAA, pp. 31-36 (1990)
17. Kolman, P., Scheideler, C: Improved bounds for the unsplittable flow problem. J. Algorithms 61(1), 20-44 (2006)
18. Maggs, B.M., Meyer auf der Heide, F., Vocking, B., Westermann, M.: Exploiting locality for networks of limited bandwidth. In: Proc. of the 38th FOCS, pp. 284-293 (1997)
19. Maggs, B.M., Miller, G.L., Parekh, O., Ravi, R., Woo, S.L.M.: Finding effective support-tree preconditioners. In: Proc. of the 17th SPAA, pp. 176-185 (2005)
20. Meyer auf der Heide, F., Vöcking, B.: A packet routing protocol for arbitrary networks. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 291-302. Springer, Heidelberg (1995)
21. 1+∈ N) local control packet switching algorithms. In: Proc. of the 29th STOC, pp. 644-653 (1997)
22. Rabin, M.O.: Efficient dispersal of information for security, load balancing and fault tolerance. J. ACM 36, 335-348 (1989)
23. Räcke, H.: Minimizing congestion in general networks. In: Proc. of the 43rd FOCS, pp. 43-52 (2002)
24. Räcke, H.: Data Management and Routing in General Networks. PhD thesis, Uni-versität Paderborn (2003)
25. Räcke, H.: Optimal hierarchical decompositions for congestion minimization in networks. In: Proc. of the 40th STOC, pp. 255-264 (2008)
26. Upfal, E.: Efficient schemes for parallel communication. J. ACM 31(3), 507-517 (1984)
27. Valiant, L.G., Brebner, G.J.: Universal schemes for parallel communication. In: Proc. of the 13th STOC, pp. 263-277 (1981)
28. Vöcking, B.: Static and Dynamic Data Management in Networks. PhD thesis, Uni-versität Paderborn (December 1998)
29. Vöcking, B.: Almost optimal permutation routing on hypercubes. In: Proc. of the 33rd STOC, pp. 530-539 (2001)
30. Westermann, M.: Caching in Networks: Non-Uniform Algorithms and Memory Capacity Constraints. PhD thesis, Universität Paderborn (November 2000)