Download:
|
by Efstratios Karaivazoglou, Paul Spirakis, Vasilis Triantafilou
http://hni.uni-paderborn.de/graduierte/karaiw/papers/cocoon.ps.gz
Add To MetaCart
Abstract:
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. 1
Citations
|
155
|
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
– Duato
- 1993
|
|
74
|
Multihop lightwave networks: A comparison of store-and-forward and hot-potato routing
– Acampora, Shah
- 1992
|
|
49
|
Deadlock free message routing in multiprocessor interconnection networks
– Dally, Seitz
- 1987
|
|
42
|
A theory of wormhole routing in parallel computers
– Felperin, Raghavan, et al.
- 1992
|
|
38
|
Comparison of Deflection and Store-and-Forward
– Maxemchuk
- 1989
|
|
36
|
Fast deflection routing for packets and worms
– Bar-Noy, Raghavan, et al.
- 1993
|
|
32
|
Bounds on evacuation time for deflection routing
– Hajek
- 1991
|
|
29
|
Potential function analysis of greedy hot-potato routing
– Ben-Dor, Halevi, et al.
- 1998
|
|
29
|
Bounds on maximum delay in networks with deflection routing
– Brassil, Cruz
- 1995
|
|
23
|
Mesh and torus chaotic routing
– Bolding, Snyder
|
|
21
|
Adaptive routing in mesh-connected networks
– Glass, Ni
- 1992
|
|
18
|
Universal wormhole routing
– Greenberg, Oh
- 1993
|
|
15
|
Nearly tight bounds for wormhole routing
– Ranade, Schleimer, et al.
- 1994
|
|
7
|
An analysis of "hot-potato" routing in a fiber optic packet switched hypercube
– Szymanski
- 1990
|
|
5
|
On the design of deadlock free adaptive routing algorithms for multicomputers: theoretical aspects
– Duato
- 1991
|
|
4
|
Greedy Hot-Potato Routing on the Mesh
– Ben-Aroya, Schuster
- 1994
|
|
1
|
Efficient routing algorithms for parallel computers
– Karaivazoglou
- 1995
|
|
1
|
Wormhole routing simulation on a mesh. To appear
– Karaivazoglou, Spirakis, et al.
- 1995
|
|
1
|
Oblivious Deflection Wormhole Routing
– Heide, Scheideler, et al.
|
|
1
|
Average case analysis of greedy hot-potato routing in the mesh
– Spirakis, Triantafillou
|
|
1
|
Wormhole routing simulation on a mesh
– Karaivazoglou, Spirakis, et al.
- 1995
|
