Oblivious routing on geometric networks

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2005, Pages 316-324

  Busch, Costas ^a   Magdon Ismail, Malik ^a   Xi, Jing ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Congestion; Disc Graphs; Geometric Networks; Oblivious Routing; Stretch

Indexed keywords

CONGESTION CONTROL (COMMUNICATION); GEODESY; GRAPH THEORY; ROUTERS;

DISC GRAPHS; GEOMETRIC NETWORKS; OBLIVIOUS ROUTING;

TELECOMMUNICATION NETWORKS;

EID: 32144460830     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073970.1074022     Document Type: Conference Paper

References (20)

1. J. Aspens, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. Online load balancing with applications to machine scheduling and virtual circuit routing. In Proceedings of the 85th ACM Symposium on Theory of Computing, pages 623-631, 1993.
2. B. Awerbuch and Y. Azar. Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation. In Proceedings of 35th Annual Symposium on Foundations of Computer Science, pages 240-249, Santa Fe, New Mexico, 1994.
3. Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Racke. Optimal oblivious routing in polynomial time. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), pages 383-388, San Diego, CA, June 2003. ACM Press.
4. Marcin Bienkowski, Miroslaw Korzeniowski, and Harald Räcke. A practical algrorithm for constructing oblivious routing schemes. In Proceedings of the 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pages 24-33, Jun. 2003.
5. A. Borodin and J. E. Hopcroft. Routing, merging, and sorting on parallel models of computation. Journal of Computer and System Science, 30:130-145, 1985.
6. Costas Busch, Malik Magdon-Ismail, and Jing Xi. Optimal oblivious path selection on the mesh. In Proceedings of the 19th IEEE International Parallel & Distributed Processing Symposium (IPDPS 2005), Denver, Colorado, April 2005.
7. Jie Gao and Li Zhang. Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs. In PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pages 189-196, New York, NY, USA, 2004.
8. Chris Harrelson, Kristen Hildrum, and Satish Rao. A polynomial-time tree decomposition to minize congestion. In Proceedings of the 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pages 34-43, Jun. 2003.
9. Christos Kaklamanis, Danny Krizanc, and Thanasis Tsantilas. Tight bounds for oblivious routing in the hypercube. In Proceedings of 2nd IEEE Symposium on Parallel and Distributed Processing (2nd SPAA 90), pages 31-36, Crete, Greece, July 1990.
10. F. T. Leighton, B. M. Maggs, and S. B. Rao. Packet routing and job-scheduling in O(congestion + dilation) steps. Combinatorica, 14:167-186, 1994.
11. Tom Leighton, Bruce Maggs, and Andrea W. Richa. Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica, 19:375-401, 1999.
12. B. M. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westerman. Exploiting locality in data management in systems of limited bandwidth. In Proceedings of the 38th Annual Symposium on the Foundations of Computer Science, pages 284-293, 1997.
13. Friedhelm Meyer auf der Heide and Berthold Vöcking. Shortest-path routing in arbitrary networks. Journal of Algorithms, 31(1):105-131, April 1999.
14. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, UK, 2000.
15. 1+ε N) local control packet switching algorithms. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, pages 644-653, New York, May 1997.
16. Harald Räcke. Minimizing congestion in general networks. In Proceedings of the 43rd Annual Symposium on the Foundations of Computer Science, pages 43-52, Nov. 2002.
17. P. Raghavan and C. D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365-374, 1987.
18. A. Srinivasan and C-P. Teo. A constant factor approximation algorithm for packet routing, and balancing local vs. global criteria. In Proceedings of the ACM Symposium on the Theory of Computing (STOC), pages 636-643, 1997.
19. L. G. Valiant. A scheme for fast parallel communication. SIAM Journal on Computing, 11:350-361, 1982.
20. L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing, pages 263-277, May 1981.