摘要
将直角坐标系引入双环网络,通过直角坐标系,系统研究双环网络G(N;r,s)的容错路由,提出将双环网络和直角坐标系结合起来,使节点可视可控.基于直角坐标系研究双环网络G(N;r,s)的容错路由,解决多节点故障时源节点如何快速建立和目的节点之间的路由.首次提出故障节点封闭区和节点逃逸区,在此基础上提出多节点故障时容错路由最优算法,并用实例验证算法的正确性.
A new method to research fault-tolerant routing of unidirectional double-loop networks G(N;r,s) is presented in the paper based on cartesian coordinates which makes the nodes of the net- works become visual and controllable, using this method, we present the fault tolerance measures and simulation techniques when serveral nodes are fault. Firstly, we give the definition of closing areas and escaping areas of faulty nodes. Then, we present the measures of constructing the shortest path between the source node and the destination node when serveral nodes are fault. At last,we give the simulation of fault-tolerant routing of unidirectional double-loop networks G(N; r,s) for any given nodes.
出处
《华中科技大学学报(自然科学版)》
EI
CAS
CSCD
北大核心
2010年第10期43-46,51,共5页
Journal of Huazhong University of Science and Technology(Natural Science Edition)
基金
安徽省教育厅重大项目(ZD2008005-1)
安徽省计算与通信软件重点实验室资助项目
关键词
双环网络
容错
最短路径
最优路由
直角坐标系
double-loop networks
fault-tolerance
shortest path
optimal routing
cartesian coordinates