Õ(congestion + dilation) hot-potato routing on leveled networks

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2002, Pages 20-30

  Busch, Costas ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

Congestion; Dilation; Hot potato routing; Leveled networks

Indexed keywords

ALGORITHMS; CONGESTION CONTROL (COMMUNICATION); FIBER OPTIC NETWORKS; MULTIPROCESSING SYSTEMS; ROUTERS; TELECOMMUNICATION LINKS; TELECOMMUNICATION TRAFFIC; THEOREM PROVING;

HOT-POTATO ALGORITHM; HOT-POTATO ROUTING; MULTIPROCESSOR NETWORK; PACKET ROUTING;

PACKET NETWORKS;

EID: 0036953736     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/564871.564874     Document Type: Conference Paper

References (26)

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. S. Alstrup, J. Holm, K. de Lichtenberg, and M. Thorup. Direct routing on trees. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 342-349, 1999.
3. P. Baran. On distributed communications networks. IEEE Transactions on Communications, pages, 1-9, 1964.
4. C. Bartzis, I. Caragiannis, C. Kaklamanis, and I. Vergados. Experimental evaluation of hot-potato routing algorithms on 2-dimensional processor arrays. In EUROPAR: Parallel Processing, 6th International EURO-PAR Conference, pages 877-881. LNCS, 2000.
5. A. Ben-Dor, S. Halevi, and A. Schuster. Potential function analysis of greedy hot-potato routing. Theory of Computing Systems, 31(1):41-61, Jan./Feb. 1998.
6. S. N. Bhatt, G. Bilardi, G. Pucci, A. G. Ranade, A. L. Rosenberg, and E. J. Schwabe. On bufferless routing of variable-length message in leveled networks. In Proc. European Symposium on Algorithms, pages 49-60, 1993.
7. 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.
8. J. T. Brassil and R. L. Cruz. Bounds on maximum delay in networks with deflection routing. IEEE Transactions on Parallel and Distributed Systems, 6(7):724-732, July 1995.
9. A. Broder and E. Upfal. Dynamic deflection routing on arrays. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 348-358, May 1996.
10. C. Busch, M. Herlihy, and R. Wattenhofer. Hard-potato routing. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, pages 278-285, May 2000.
11. 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, Jan. 2000.
12. U. Feige and P. Raghavan. Exact analysis of hot-potato routing. In IEEE, editor, Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, pages 553-562, Pittsburgh, PN, Oct. 1992.
13. W. D. Hillis. The Connection Machine. MIT press, 1985.
14. C. Kaklamanis, D. Krizanc, and S. Rao. Hot-potato routing on processor arrays. In Proceedings of the 5th Annual ACM Symposium on Parallel Algorithms and Architectures, pages 273-282, Velen, Germany, June 30-July 2, 1993.
15. F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays - Trees - Hypercubes. Morgan Kaufmann, San Mateo, 1992.
16. F. T. Leighton, B. M. Maggs, A. G. Ranade, and S. B. Rao. Randomized routing and sorting on fixed-connection networks. J. Algorithms, 17(1):157-205, 1994.
17. 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.
18. T. Leighton, B. Maggs, and A. W. Richa. Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica, 19:375-401, 1999.
19. N. F. Maxemchuk. Comparison of deflection and store and forward techniques in the Manhattan street and shuffle exchange networks. In Proc. IEEE INFOCOM, pages 800-809, 1989.
20. F. Meyer auf der Heide and C. Scheideler. Routing with bounded buffers and hot-potato routing in vertex-symmetric networks. In P. G. Spirakis, editor, Proceedings of the Third Annual European Symposium on Algorithms, volume 979 of LNCS, pages 341-354, Corfu, Greece, 25-27 Sept. 1995.
21. F. Meyer auf der Heide and B. Vöcking. Shortest-path routing in arbitrary networks. Journal of Algorithms, 31(1):105-131, Apr. 1999.
22. 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.
23. Y. Rabani and É. Tardos. Distributed packet switching in arbitrary networks. In Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, pages 366-375, Philadelphia, Pennsylvania, 22-24, May 1996.
24. C. L. Seitz. The caltech mosaic C: An experimental, fine-grain multicomputer. In Proceedings 4th Symp. on Parallel Algorithms and Architectures, June 1992. Keynote Speech.
25. 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.
26. T. Szymanski. An analysis of "hot potato" routing in a fiber optic packet switched hypercube. In Proc. IEEE INFOCOM, pages 918-925, 1990.