Hard-potato routing

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 278-285

  Busch, Costas ^a   Herlihy, Maurice ^a   Wattenhofer, Rogert ^a  

^a BROWN UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH PROBABILITY; HOT-POTATO ROUTING; LOWER BOUNDS; MAXIMUM PATH LENGTHS; POLY-LOGARITHMIC FACTORS; ROUTING PROBLEMS; ROUTING TECHNIQUES; RUNNING TIME;

ALGORITHMS; CONGESTION CONTROL (COMMUNICATION); PROBABILITY;

COMPUTATION THEORY; PACKET NETWORKS;

HARD-POTATO ROUTING;

EID: 0033706883     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.338762     Document Type: Conference Paper

References (20)

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. P. Baran. On distributed communications networks. IEEE Transactions on Communications, pages 1-9, 1964.
3. I. Ben-Aroya, T. Eilam, and A. Schuster. Greedy hot-potato routing on the two-dimensional mesh. Distributed Computing, 9(1):3-19, 1995.
4. I. Ben-Aroya, I. Newman, and A. Schuster. Randomized single-target hot-potato routing. Journal of Algorithms, 23(1):101-120, Apr. 1997. (Pubitemid 127451242)
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. (Pubitemid 128395537)
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. (Pubitemid 127768792)
7. 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.
8. 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. IEEE Computer Society Press.
9. A. G. Greenberg and J. Goodman. Sharp approximate models of deflection routing. IEEE Transactions on Communications, 41(1):210-223, Jan. 1993.
10. W. D. Hillis. The Connection Machine. MIT press, 1985.
11. 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. SIGACT and SIGARCH.
12. M. Kaufmann, H. Lauer, and H. Schroder. Fast deterministic hot-potato routing on meshes. In Springer-Verlag, editor, Proc. of the 5th International Symposium on Algorithms and Computation (ISAAC), Lecture Notes in Computer Science, volume 834, pages 333-341, 1994.
13. Y. Mansour and B. Patt-Shamir. Many-to-one packet routing on grids. In Proceedings of the Twenty-Seventh Annual ACM Symposium on the Theory of Computing, pages 258-267, 29 May-1 June 1995.
14. 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.
15. I. Newman and A. Schuster. Hot-potato algorithms for permutation routing. IEEE Transactions on Parallel and Distributed Systems, 6(11):1168-1176, Nov. 1995.
16. C. L. Seitz. The caltech mosaic C: An experimental, fine-grain multicomputer. In 4th symp. on Parallel Algorithms and Architectures, June 1992. Keynote Speech.
17. B. Smith. Architecture and applications of the HEP multiprocessor computer system. In Proc. Fourth Symp. Real Time Signal Processing IV, pages 241-248. SPIE, 1981.
18. P. Spirakis and V. Triantafillou. Pure greedy hot-potato routing in the 2-D mesh with random destinations. Parallel Processing Letters, 7(3):249-258, Sept. 1997. (Pubitemid 127732097)
19. T. Szymanski. An analysis of "hot potato" routing in a fiber optic packet switched hypercube. In Proc. IEEE INFOCOM, pages 918-925, 1990.
20. Z. Zhang and A. S. Acampora. Performance analysis of multihop lightwave networks with hot potato routing and distance age priorities. In Proc. IEEE INFOCOM, pages 1012-1021, 1991.