李颖, 王建堃, 陈业斌. 有向双环网络G(N;h)的容错路由算法[J]. 微电子学与计算机, 2010, 27(9): 91-94,99.
引用本文: 李颖, 王建堃, 陈业斌. 有向双环网络G(N;h)的容错路由算法[J]. 微电子学与计算机, 2010, 27(9): 91-94,99.
LI Ying, WANG Jian-kun, CHEN Ye-bin. The Fault-tolerant Routing Algorithm of Directed Double-loop Networks[J]. Microelectronics & Computer, 2010, 27(9): 91-94,99.
Citation: LI Ying, WANG Jian-kun, CHEN Ye-bin. The Fault-tolerant Routing Algorithm of Directed Double-loop Networks[J]. Microelectronics & Computer, 2010, 27(9): 91-94,99.

有向双环网络G(N;h)的容错路由算法

The Fault-tolerant Routing Algorithm of Directed Double-loop Networks

  • 摘要: 针对有向双环网络G(N;h)的容错问题,研究了有向双环网络G(N;h)容错节点所对应的等价节点的分布规律,给出一种有向双环网络G(N;h)的容错路由算法.给出了当有向双环网络任意两个节点之间的最短路径出现故障时,找出另一条最短路径的方法.此算法的时间复杂度为O(d).

     

    Abstract: In order to improve the fault-tolerant performance of directed double-loop networks G(N;h),the distribution about equal nodes for fault-tolerant nodes of directed double-loop networks G(N;h)was studied,and presented a way to find the fault-tolerant routing algorithm of double-loop networks G(N;h).That is,when the shortest path fails between any two nodes of the double-loop networks,how to find the other one.The time complexity of the algorithm is O(d).

     

/

返回文章
返回