Abstract
We consider the hot-potato routing problem. The striking feature of this form of packet routing is that there are no buffers at the nodes. Thus packets are always moving.
A probabilistic hot-potato routing protocol is presented that routes random functions on the (n, d)-torus. If at most d/88 n d packets, evenly distributed among the processors, have to be routed, they all have reached their destinations in dn+O(d 3log n) steps, with high probability, if 3≤d=O(n ɛ) with ɛ ε (0, 1/2). This improves upon previous results where similar time bounds are only obtained for constant d and n d packets.
This work is partially supported by the DFG-Forschergruppe “Effiziente Nutzung massiv paralleler Systeme”; and the DFG Leibnitz Grant
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. Acampora and S. Shah: Multihop lightwave networks: a comparison of store-and-forward and hot-potato routing. IEEE Transactions on Communications 40 (1992) 1082–1090
U. Feige and P. Raghavan: Exact analysis of hot-potato routing. Proceedings of the 33rd Symposium on Foundation of Computer Science (1992) 553–562
J. Goodman and A. Greenberg: Sharp approximate models of deflection routing in mesh networks. IEEE Transactions on Communications 41 (1993) 210–223
A. Greenberg and B. Hajek: Deflection routing in hypercube networks. IEEE Transaction on Communications 40 (1992) 1070–1081
B. Hajek: Bounds on evacuation time for deflection routing. Distributed Computing 5 (1991) 1–6
B. Hajek and A. Krishna: Performance of shuffle-like switching networks with deflections. Proceedings of the IEEE INFOCOM (1990) 473–480
C. Kaklamanis, D. Krizanc and S. Rao: Hot-potato routing on processor arrays. Proceedings of the 5th Symposium on Parallel Algorithms and Architectures (1993) 273–282
N. Maxemchuk: Comparison of deflection and store-and-forward techniques in the manhattan street and shuffle-exchange networks. Proceedings of the IEEE INFOCOM (1989) 800–809
T. Szymanski: An analysis of “hot-potato”; routing in a fiber optic packet switched hypercube. Proceedings of the IEEE INFOCOM (1990) 918–925
M. Westermann: Hot-potato routing. Diplomarbeit, University of Paderborn (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meyer, F., Westermann, M. (1995). Hot-potato routing on multi-dimensional tori. In: Nagl, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 1995. Lecture Notes in Computer Science, vol 1017. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60618-1_77
Download citation
DOI: https://doi.org/10.1007/3-540-60618-1_77
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60618-5
Online ISBN: 978-3-540-48487-5
eBook Packages: Springer Book Archive