基于超立方体容错路由算法分析  

Fault Tolerant Routing Algorithm on Hypercube Networks

作　　者：林玮[1] 杨小帆[1] 

机构地区：[1]重庆大学计算机学院,重庆400044

出　　处：《计算机应用研究》2007年第7期273-275,共3页Application Research of Computers

基　　金：教育部博士点基金资助项目(20050611001)

摘　　要：基于超立方体的优良的拓扑性质,提出了一个应用于超立方体网络的容错路由算法。该容错路由算法是基于局部信息的,因为路由算法在路由过程中,只需要知道其邻节点的信息,而无须知道其他节点的出错情况。对于给定的源节点和目的节点,路由算法均能够找到一条最优容错路径,并且可以预防死锁。模拟实验结果表明,路由算法所构造的路由路径长度接近于两个节点之间的最优路径长度。This paper proposed a novel and simple fault tolerance routing algorithm based on hypercube. On the one hand, the algorithm was based on local information, because each node knows only its neighbors＇ status and no global information of the network was required by the algorithms in the course of routing. On the other hand, for the given pair of source node and destination node, the algorithms could find a better-path. Simulation results show that the length of the routing path constructed by this algorithm is very close to the optimal length.

关 键 词：超立方体网络 容错 空闲维 

分 类 号：TP302.8[自动化与计算机技术—计算机系统结构]