Several analytical models of fully adaptive routing have recently been proposed for k-ary n-cubes and hypercube networks under the uniform traffic pattern. Although,hypercube is a special case of k-ary n-cubes topology, the modeling approach for hypercube is more accurate than karyn-cubes due to its simpler structure. This paper proposes a general analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing that uses a similar modeling approach to hypercube. The analysis focuses Duato's fully adaptive routing algorithm , which is widely accepted as the most general algorithm for achieving adaptivity in wormhole-routed networks while allowing for an efficient router implementation. The proposed model is general enough that it can be used for hypercube and other fully adaptive routing algorithms.
|Number of pages||7|
|Publication status||Published - 24 Jul 2003|
|Event||International Symposium on Performance Evaluation of Computer and Telecommunication Systems - Montreal, Canada|
Duration: 20 Jul 2003 → 24 Jul 2003
|Conference||International Symposium on Performance Evaluation of Computer and Telecommunication Systems|
|Period||20/07/03 → 24/07/03|
- adaptive routing
- hypercube networks
- telecommunications systems
- computer systems
Khonsari, A., Ould-Khaoua, M., & Ferguson, J. D. (2003). A general analytical model of adaptive wormhole routing in k-ary n-cubes. 547-554. Paper presented at International Symposium on Performance Evaluation of Computer and Telecommunication Systems, Montreal, Canada, .