Abstract
Recently, Chinn, Leighton, and Tompa [10] presented lower bounds for store-and-forward permutation routing algorithms on the n × n mesh with bounded buffer size and where a packet must take a shortest (or minimal) path to its destination. We extend their analysis to algorithms that are nearly minimal. (In their preliminary work, Chinn et al. [10] mention a similar result that seems, however, incorrect.) We also apply this technique to the domain of hot potato algorithms, where there is no storage of packets and the shortest path to a destination is not assumed (and is in general impossible).We show that “natural” variants and “improvements” of several algorithms in the literature perform poorly in the worst case. As a result, we identify algorithmic features that are undesirable for worst case hot potato permutation routing.
Researchers in hot potato routing have defined simple and greedy classes of algorithms. We show that when an algorithm is too simple and too greedy, its performance in routing permutations is poor in the worst case. Specifically, the technique of [10] is also applicable to algorithms that do not necessarily send packets in minimal or even nearly minimal paths: it may be enough that they naively attempt to do so when possible. In particular, our results show that a certain class of greedy algorithms that was suggested recently by Ben-Dor, Halevi, and Schuster [6] contains algorithms that have poor performance in routing worst case permutations.
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. Chinn was supported in part by the National Science Foundation under Grant MIP-9213469, and in part by NSERC as a Postdoctoral Fellow at York University. A previous version of this work is Technion Technical Report LPCR/9405, May 1994.
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 INFOCOM, pages 10–19. IEEE, 1991.
A. Bar-Noy, P. Raghavan, B. Schieber, and H. Tamaki. Fast deflection routing for packets and worms. In Proceedings 12th Symposium on Principles of Distributed Computing, pages 75–86. ACM, 1993.
P. Baran. On distributed communications networks. IEEE Transactions on Communications, 12:1–9, 1964.
I. Ben-Aroya, I. Newman, and A. Schuster. Randomized single target hot potato routing. To appear in J. of Algorithms, 1996. (Also in Proceedings of the 3rd Israeli Symposium on Theory of Computing and Systems, January 1995, pages 20–29).
I. Ben-Aroya, E. Tamar, and A. Schuster. Greedy hot-potato routing on the two-dimensional mesh. Distributed computing, 9(1):3–19, 1995. (Also in Proceedings of the 2nd European Symposium on Algorithms, Utrecht, 1994).
A. Ben-Dor, S. Halevi, and A. Schuster. Potential function analysis of greedy hotpotato routing. In Proceedings of the 13th Symposium on Principles of Distributed Computing, pages 225–234, Los Angeles, August 1994. ACM. (Also Technion/LPCR TR #9303, January 1993.).
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. Borodin, Y. Rabani, and B. Schieber. Deterministic many-to-many hot potato routing. Technical Report RC 20107, IBM Watson Research Report, 1995.
J.T. Brassil and R.L. Cruz. Bounds on maximum delay in networks with deflection routing. In Proceedings of the 29th Allerton Conference on Communication, Control and Computing, pages 571–580, 1991.
D.D. Chinn, T. Leighton, and M. Tompa. Minimal adaptive routing on the mesh with bounded queue size. Journal of Parallel and Distributed Computing, 34(2):154–170, 1996. Preliminary version in Proceedings of the 6th Symposium on Parallel Algorithms and Architectures, June 1994, pages 354–363.
U. Feige. Observations on hot potato routing. In Proceedings of the 3rd Israeli Symposium on Theory of Computing and Systems, pages 30–39, January 1995.
U. Feige and P. Raghavan. Exact analysis of hot-potato routing. In Proceedings of the 33rd Symposium on Foundations of Computer Science, pages 553–562. IEEE, November 1992.
A.G. Greenberg and J. Goodman. Sharp approximate models of adaptive routing in mesh networks. In O.J. Boxma, J.W. Cohen, and H.C. Tijms, editors, Teletraffic Analysis and Computer Performance Evaluation, pages 255–270. Elsevier, Amsterdam, 1986.
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 Satish Rao. Hot-potato routing on processor arrays. In Proceedings of the 5th Symposium on Parallel Algorithms and Architectures, pages 273–282. ACM, 1993.
M. Kaufmann, H. Lauer, and H. Schröder. Fast deterministic hot-potato routing on meshes. In Proceedings of the 5th International Symposium on Algorithms and Computation (ISAAC), volume 834 of Lecture Notes in Computer Science, pages 333–341. Springer-Verlag, 1994.
D.H. Lawrie and D.A. Padua. Analysis of message switching with shuffle-exchanges in multi-processors. Workshop on Interconnection Networks for Parallel and Distributed Computing, pages 116–123, 1980.
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. IEEE Transactions on Parallel and Distributed Systems, 6(11):1168–1176, November 1995.
J.Y. Ngai and C.L. Seitz. A framework for adaptive routing in multicomputer networks. In Proceedings of the 1st Symposium on Parallel Algorithms and Architectures, pages 1–9. ACM, 1989.
T. Szymanski. An analysis of hot potato routing in a fiber optic packet switched hypercube. In IEEE INFOCOM, pages 918–926, 1990.
L.G. Valiant. Optimality of a two-phase strategy for routing in interconnection networks. IEEE Transactions on Computers, C-32(9), September 1983.
Z. Zhang and A.S. Acampora. Performance analysis of multihop lightwave networks with hot potato routing and distance age priorities. In IEEE INFOCOM, pages 1012–1021, 1991.
Author information
Authors and Affiliations
Corresponding author
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ben-Aroya, I., Chinn, D.D., Schuster, A. (1996). A lower bound for nearly minimal adaptive and hot potato algorithms. In: Diaz, J., Serna, M. (eds) Algorithms — ESA '96. ESA 1996. Lecture Notes in Computer Science, vol 1136. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61680-2_76
Download citation
DOI: https://doi.org/10.1007/3-540-61680-2_76
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61680-1
Online ISBN: 978-3-540-70667-0
eBook Packages: Springer Book Archive