New globally adaptive load-balanced routing algorithm for k-ary n-cubes
一种k元n方网络中的全局自适应负载均衡路由算法

Routing is one of the key issues in the researches of k-ary n-cubes, and globally adaptive load-balanced routing can provide high throughput on various traffic patterns, A new detection-based scheme was proposed to handle routing deadlock, which was efficient and easy to implement. A globally adaptive load-balanced routing algorithm adopting this scheme was also put forward, which has higher routing adaptability than previously published algorithms. Simulation results demonstrate that the throughput of this algorithm exceeds that of the previously published algorithms by 18% on benign traffic pattern, and by 10% - 24% on adversarial traffic patterns