Abstract
We propose hot-potato (or, deflection) packet routing algorithms on the two-dimensional mesh. The algorithms are strongly greedy in the sense that they attempt to send packets in good directions whenever possible. Furthermore, the routing operations are simple and independent of the time that has elapsed. These two features suggest that the algorithms are practical and may also be used for continuous routing. The first algorithm gives the best evacuation time known for delivering all the packets to their destinations. A batch of k packets with maximal source-to-destination distance d max is delivered in 2(k −1)+d max . The second algorithm improves this bound to k+d max when all packets are destined to the same node. This also implies a new bound for the multitarget case, which is the first to take into account the number of in-edges of a node. The third algorithm is designed for routing permutations in which the maximal source-to-destination distance is small. In particular, when routing permutations for which d max =3, the algorithm terminates in at most seven steps. We also show a lower bound of five steps for this problem.
This work was supported in part by the French-Israeli grant for cooperation in Computer Science, and by a grant from the Israeli Ministry of Science.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A.S. Acampora and S.I.A. Shah. Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing. In IEEE INFOCOM, pages 10–19, 1991.
P. Baran. On distributed communications networks. IEEE Transactions on Communications, 12:1–9, 1964.
J.T. Brassil and R.L. Cruz. Bounds on maximum delay in networks with deflection routing. In 29th annual Allerton conf. on Communication, Control and Computing, pages 571–580, 1991.
Ishai Ben-Aroya. Algorithms and bounds for deflection routing. Master's thesis (In Hebrew), April 1994.
A. Borodin and J.E. Hopcroft. Routing, merging, and sorting on parallel models of computation. Journal of Computer and System Sciences, 30:130–145, 1985.
A. Ben-Dor, S. Halevi, and A. Schuster. Potential function analysis of greedy hot-potato routing. In Proc. of 13th ACM Symp. on Principles of Distr. Comput., Los Angeles, August 1994. To appear. (Also: LPCR TR #9204, CS Dept., Technion, Jan. 1993).
I. Ben-Aroya, I. Newman, and A. Schuster. Randomized single target hot potato routing. Manuscript, 1994.
A. Borodin, Y. Rabani, and B. Schieber. Deterministic many-to-many hot potato routing. Manuscript, 1994.
A. Bar-Noy, P. Raghavan, B. Schieber, and H. Tamaki. Fast deflection routing for packets and worms. In Proc. 12th ACM symp. on Principles Of Distributed Computing, 1993.
I. Ben-Aroya and A. Schuster. Greedy hot-potato routing on the two-dimensional mesh. Technical Report LPCR TR #9320, Technion, CS, November 1993.
I. Ben-Aroya and A. Schuster. A CLT-type lower bound for routing permutations on the mesh by hot-potato algorithms. Technical Report LPCR #9405, CS dept. Technion, May 1994.
U. Feige. Observations on hot potato routing. Manuscript, 1994.
U. Feige and P. Raghavan. Exact analysis of hot-potato routing. In proc. IEEE symp. on foundations of computer Science, November 1992.
A.G. Greenberg and B. Hajek. Deflection routing in hypercube networks. IEEE Transactions on Communications, June 1992.
B. Hajek. Bounds on evacuation time for deflection routing. Distributed Computing, 5:1–6, 1991.
C. Kaklamanis, D. Krizanc, and S. Rao. Hot-potato routing on processor arrays. In Symp. of Parallel Algorithms and Architectures, 1993.
M. Kaufmann, H. Lauer, and H. Schroder. Fast deterministic hot-potato routing on processor arrays. In ISAAC, 1994. To appear.
N.F. Maxemchuk. Comparison of deflection and store and forward techniques in the manhattan street and shuffle exchange networks. In IEEE INFOCOM, pages 800–809, 1989.
I. Newman and A. Schuster. Hot-potato algorithms for permutation routing. Technical Report LPCR #9201, CS dept. Technion, November 1992.
R. Prager. An algorithm for routing in hypercube networks. Master's thesis, 1986.
C.L. Seitz, N. Boden, J. Seizovic, and W. Su. The design of the Caltech Mosaic C multicomputer. In Proc. Symp. on Integrated Systems, pages 1–22, 1993.
B. Smith. Architecture and applications of the HEP multiprocessor computer system. In Proc. (SPIE) Real Time Signal Processing IV, pages 241–248, 1981.
T. Szymanski. An analysis of hot potato routing in a fiber optic packet switched hypercube. In Proc. IEEE INFOCOM, pages 918–926, 1990.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ben-Aroya, I., Schuster, A. (1994). Greedy hot-potato routing on the mesh. In: van Leeuwen, J. (eds) Algorithms — ESA '94. ESA 1994. Lecture Notes in Computer Science, vol 855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0049423
Download citation
DOI: https://doi.org/10.1007/BFb0049423
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58434-6
Online ISBN: 978-3-540-48794-4
eBook Packages: Springer Book Archive