A simple mathematical model of adaptive routing in wormhole k-ary n-cubes

H. Sarbazi-Azad, M. Ould-Khaoua
2002 Proceedings of the 2002 ACM symposium on Applied computing - SAC '02  
Many fully-adaptive algorithms have been proposed for k-ary ncubes over the past decade. The performance characteristics of most of these algorithms have been analysed by means of software simulation only. This paper proposes a simple yet reasonably accurate analytical model to predict message latency in wormholerouted k-ary n-cubes with fully adaptive routing. This model requires a running time of O(I) which is the fastest model yet reported in the literature while maintaining reasonable accuracy.
doi:10.1145/508791.508954 dblp:conf/sac/Sarbazi-AzadO02 fatcat:btjwnx5xvrgtbotofttvwx5svi