摘要
本文对C.S.Raghavendra等人提出的最佳双环网,给出了无故障情况下的最佳路由算法(NCR)和故障情况下的容错算法(FTR),且FTR在网络同时出现故障的结点数小于3时,保证信息沿最短路径传输.
For the optimal double-loop local network, this paper presents an opti-mal routing algorithm (NCR) under the condition of no crash nodes and a fault-tolerant routing algorithm(FTR) under the condition of some crash nodes. If the number of crash nodes detected at any time is not greater than two, FTR guarantees that the message be sent through the shortest path (if it exists).
出处
《计算机学报》
EI
CSCD
北大核心
1992年第6期457-464,共8页
Chinese Journal of Computers
关键词
局域网
路由算法
双环网
Double-loop local network, routing algorithm, fault-tolerant, optimal a'-gorithm.
