Minimal vs. non Minimal Adaptive Routing on k-ary n-cubes.
Fabrizio Petrini, Marco Vanneschi · 1996
There is a common agreement in the scientific community that adaptive routing algorithms will eventually replace the deterministic ones that are currently in use in multicomputer networks. An open issue in this research area is to determine the optimal degree of adaptivity that the routing algorithm should provide. Through simulation on a 16-ary 2-cube, we analyze some minimal wormhole algorithms based on Duato's methodology and a non minimal cutthrough algorithm, the Chaos routing. The experimental results show that the Chaos routing outperforms the minimal adaptive algorithms under the uniform traffic, but suffers from post saturation problems with the complement, transpose and bit reversal traffics.