Optimal oblivious path selection on the mesh

Proceedings - 19th IEEE International Parallel and Distributed Processing Symposium, IPDPS 2005

Volumn 2005, Issue , 2005, Pages 82-

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

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MESH; OPTIMAL CONGESTION; PATH SELECTION; TRAFFIC DISTRIBUTION;

ALGORITHMS; ASYMPTOTIC STABILITY; CONGESTION CONTROL (COMMUNICATION); DISTRIBUTED COMPUTER SYSTEMS; PACKET NETWORKS; ROUTERS; TELECOMMUNICATION TRAFFIC;

OPTIMAL CONTROL SYSTEMS;

EID: 32144448246     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2005.311     Document Type: Conference Paper

References (14)

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 25th 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. Jie Gao and Li Zhang. Tradeoff between stretch factor and load balancing ratio in wireless network routing. In Proceedings of th Symposium on Principles of Distributed Computing (PODC), page to appear, 2004.
7. 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.
8. 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.
9. 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.
10. Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, UK, 2000.
11. 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.
12. P. Raghavan and C. D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365-374, 1987.
13. 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.
14. 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.