Near-optimal hot-potato routing on trees

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

Volumn 3149, Issue , 2004, Pages 820-827

  Busch, Costas ^a   Magdon Ismail, Malik ^a   Mavronicolas, Marios ^b   Wattenhofer, Roger ^c  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b UNIVERSITY OF CYPRUS   (Cyprus)

^c ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

HOT-POTATO; HOT-POTATO ROUTING; NEAR-OPTIMAL; POLY-LOGARITHMIC FACTORS; ROUTING DECISIONS; ROUTING PROBLEMS; TREE TOPOLOGY;

ARTIFICIAL INTELLIGENCE;

EID: 35048829948     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27866-5_109     Document Type: Article

References (18)

1. A. S. Acampora and S. I. A. Shah. Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing. In Proc. IEEE INFOCOM, pages 10-19, 1991.
2. N. Alon, F.R.K. Chung, and R.L.Graham. Routing permutations on graphs via matching. SIAM Journal on Discrete Mathematics, 7(3):513-530, 1994.
3. Stephen Alstrup, Jacob Holm, Kristian de Lichtenberg, and Mikkel Thorup. Direct routing on trees. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 98), pages 342-349, 1998.
4. P. Baran. On distributed communications networks. IEEE Transactions on Communications, pages 1-9, 1964.
5. Constantinos Bartzis, Ioannis Caragiannis, Christos Kaklamanis, and Ioannis Vergados. Experimental evaluation of hot-potato routing algorithms on 2-dimensional processor arrays. In EUROPAR: Parallel Processing, 6th International EUROPAR Conference, pages 877-881. LNCS, 2000.
6. A. Borodin, Y. Rabani, and B. Schieber. Deterministic many-to-many hot potato routing. IEEE Transactions on Parallel and Distributed Systems, 8(6):587-596, June 1997.
7. C. Busch. Õ(Congestion + Dilation) hot-potato routing on leveled networks. In Proceedings of the Fourteenth ACM Symposium on Parallel Algorithms and Architectures, pages 20-29, August 2002.
8. C. Busch, M. Herlihy, and R. Wattenhofer. Randomized greedy hot-potato routing. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pages 458-466, January 2000.
9. Costas Busch, Malik Magdon-Ismail, Marios Mavranicolas, and Paul Spirakis. Direct routing: Algorithms and Complexity. In Proceedings of the 12th Annual European Symposium on Algorithms (ESA), September 2004.
10. W. D. Hillis. The Connection Machine. MIT press, 1985.
11. T. Leighton, B. Maggs, and A. W. Richa. Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica, 19:375-401, 1999.
12. N. F. Maxemchuk. Comparison of deflection and store and forward techniuques in the Manhattan street and shuffle exchange networks. In Proc. IEEE INFOCOM, pages 800-809, 1989.
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. Grammati E. Pantziou, Alan Roberts, and Antonios Symvonis. Many-to-many routing on trees via matchings. Theoretical Comp. Science, 185(2):347-377, 1997.
15. Alan Roberts, Antonios Symvonis, and David R. Wood. Lower bounds for hotpotato permutation routing on trees. In Proc. 7th Int. Coll. Structural Information and Communication Complexity, SIROCCO, pages 281-295, June 2000.
16. C. L. Seitz. The Caltech Mosaic C: An experimental, fine-grain multicomputer. In Proc. 4th Symp. on Parallel Algorithms and Architectures, June 1992. Keynote Speech.
17. B. Smith. Architecture and applications of the HEP multiprocessor computer system. In Proceedings of the 4th Symp. Real Time Signal Processing IV, pages 241-248. SPIE, 1981.
18. L. Zhang. Optimal bounds for matching routing on trees. In Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 445-453, 1997.