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 ยฏows. The comparison with simulation models demonstrates that our methodology gives
A performance model of compressionless routing in k-ary n-cube networks
โ Scribed by A. Khonsari; M. Ould-Khaoua
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 408 KB
- Volume
- 63
- Category
- Article
- ISSN
- 0166-5316
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Several analytical models of fully adaptive routing in wormhole-routed k-ary n-cubes under the uniform traffic pattern have recently been proposed in the literature. Although the uniform reference model has been widely used in the past, it is not always true in practice as there are many application
Although several analytical models have been proposed in the literature for different interconnection networks with different routing algorithms, there is only one work [M. Ould-Khaoua, An approximate performance model for partially adaptive routing algorithm in hypercubes, Microprocessors and Micro