摘要
本文首先提出双环网中任意节点之间的最短路径求取方法；而后针对一类跨度为ｈ的双环网进行拓扑分析（Ｎ为网络规模），并构造了一个十分简便的最优寻径算法，最后给出一个容错寻径算法．
This paper proposes a method to find a shortest path between any pair of nodes in double-loop networks.Then it analyzes the topology characteristics of a class of double-loop networks with hop step,where N is the size of the networks. It also develops a simple optimal routing algorithm for them. Finally, a fault-tolerant routing algorithm is given.
出处
《计算机学报》
EI
CSCD
北大核心
1994年第11期859-865,共7页
Chinese Journal of Computers
关键词
寻径控制
双环网
分布式计算机
Path set, shortest path set, routing control, fault tolerance
