未找到相关数据
ON THE FAULT-TOLERANT ROUTING IN DISTRIBUTED LOOP NETWORKS
被引：0
作者：
Liu Huanping Yang Yixian Po Box Dept of Inform Eng Beijing Univ of Posts and Telecomm Beijing
[126
,100876
]
机构：
关键词：
Double loop networks;
Shortest path routing;
Algorithm;
D O I：
暂无
中图分类号：
TP393.02 [];
学科分类号：
081201 ;
1201 ;
摘要：
<正> Based on their "Theorem 2", an O(δ)-time algorithm of searching for the shortest path between each pair of nodes in a double loop network was proposed by K.Mukhopadyaya, et al.(1995). While, unfortunately, it will be proved that both "Theorem 2" and its proof are in error. A new and more faster O(△)-time, △≤δ, algorithm will be presented in this paper.
引用
收藏
页码：84 / 89
页数：6
相关论文