Performance evaluation of deterministic wormhole routing in k-ary n-cubes

We present a new analytical approach for the performance evaluation of deterministic wormhole routing in k-ary n-cubes. Our methodology achieves closed formulas for average time values through the analysis of network flows. The comparison with simulation models demonstrates that our methodology gives accurate results for both low and high traffic conditions. Another important quality is the flexibility of our approach. We demonstrate that it can be used to model dimension-ordered-routing in several k-ary n-cubes such as hypercubes, 3D symmetric and asymmetric tori, architectures with uni- and bi-directional channels