Abstract
In this paper we are comparing (via simulations) under real conditions, several routing algorithms based either on oblivious wormhole routing or deflection routing. Although these two techniques differ significally in the low level structure of information (worms, packets), we derived realistic results using an appropriate simulation model. In our experiments we compared average time, latency and throughput achieved by both deflection and wormhole routing (for both batch and continuous cases). Results show that deflection routing performs better than wormhole routing, for random traffic on the mesh, especially for large networks. Furthermore, although it is hard to analyze simple versions of wormhole routing, it seems that these versions outperform algorithms that are devised in order to simplify theoretical analysis. Finally we implemented and tested an algorithm that combines both deflection and wormhole routing.
Partially supported by DFG-Graduiertenkolleg Parallele Rechnernetzwerke in der Produktionstechnik, ME 872/4-1.
This research was partially supported by the European Union ESPRIT Basic Research Project GEPPCOM (contract no. 9072).
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. Bar-Noy, P. Raghavan, B. Schieber and H. Tamaki. Fast deflection routing for packets and worms. In Proc. of the 12th ACM Symp. on Princ. of Dist. Computing, pages 75–86, 1993
A. Ben-Dor, S.Halevi and A. Schuster. Potential function analysis of greedy hot-potato routing. PCL Report #9204, CS Dept., Technion, Ja. 1993
I. Ben-Aroya and A. Schuster. Greedy Hot-Potato Routing on the Mesh. In Proc. of European Symp. on Algorithms, pages 365–276, 1994
Kevin Bolding, Lawrence Snyder. Mesh and Torus Chaotic Routing, Technical Report UW-CSE-91-04-04, University of Washington, April 1991.
J. Duato. On the design of deadlock free adaptive routing algorithms for multicomputers: Theoretical aspects. In 2nd European Conf. on Dist. Memory Computing, pages 234–243, Springer Verlag LNCS 487. 1991
S. Felperin, P. Raghavan, and E. Upfal. A theory of wormhole routing in parallel computers. In Proc. of the IEEE Annual Symp. on The Found. of Comp. Science, pages 563–572, 1992
C. Glass and L. Ni. Adaptive routing in mesh-connected networks. In Proc. of the 1992 Int. Conf. on Distr. Computing Systems, pages 12–19, 1992
R. Greenberg and H.-C. Oh. Universal Wormhole Routing. In IEEE Symp. on Parallel and Dist. Processing, 1993
B. Hajek. Bounds on evacuation time for deflection routing. In Distributed Computing, Springer-Verlag, 5:pages 1–6, 1991
E. Karaivazoglou, P. Spirakis and V. Triantafillou. Wormhole routing simulation on a mesh. In Proc. of the 2nd Int. Colloquium on Structural Information and Communication Complexity, 1995
F. Meyer auf der Heide, C. Scheideier and B. Voecking. Oblivious Deflection Wormhole Routing. Preprint
A. Ranade, S. Schleimer, D. S. Wilkerson. Nearly Tight Bounds for Wormhole Routing. In Proc. of the IEEE Ann. Symp. on The Found. of Comp. Science, pages 347–355,1994
P. Spirakis and V. Triantafillou. Average case analysis of greedy hot-potato routing in the mesh. Preprint
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Karaivazoglou, E., Spirakis, P., Triantafilou, V. (1996). Wormhole versus deflection routing: A case study on the mesh. In: Cai, JY., Wong, C.K. (eds) Computing and Combinatorics. COCOON 1996. Lecture Notes in Computer Science, vol 1090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61332-3_136
Download citation
DOI: https://doi.org/10.1007/3-540-61332-3_136
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61332-9
Online ISBN: 978-3-540-68461-9
eBook Packages: Springer Book Archive