一种k元n方网络中的全局自适应负载均衡路由算法  

New globally adaptive load-balanced routing algorithm for k-ary n-cubes

作　　者：王宏[1] 许都[1] 李乐民[1] 

机构地区：[1]电子科技大学宽带光纤传输与通信网技术教育部重点实验室,四川成都610054

出　　处：《计算机应用》2007年第4期828-831,834,共5页journal of Computer Applications

基　　金：国家自然科学基金资助项目(60372011)

摘　　要：路由算法的设计是后元n方网络研究中的关键问题之一，全局自适应负载均衡路由算法对于各种业务模式都可以达到较高的吞吐率。提出了一种高效的，基于检测的避免路由死锁的新方案，并且给出了一种基于该方案的全局自适应负载均衡路由算法，比已有同类算法具有更强的路由自适应性。仿真实验表明，该算法对于良性业务模式可提高吞吐率18％，对于恶性业务模式可提高吞吐卒10％-24％。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

关 键 词：k元n方网络 自适应路由算法 负载均衡 业务模式 死锁 

分 类 号：TP393.03[自动化与计算机技术—计算机应用技术]