检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国防科学技术大学计算机学院,湖南长沙410073
出 处:《计算机工程与科学》2013年第3期8-14,共7页Computer Engineering & Science
基 金:国家863计划资助项目(2012AA01A301)
摘 要:容错路由是一种提高互连网络可用性的重要技术。针对源路由胖树网络,本文提出一种端节点动态容错路由方法。该方法采用三级路由存储层次结构,即端节点网卡存储路由表(RT),端节点内存存储扩展路由表(ERT),管理服务器硬盘存储系统扩展路由表(SERT)。同时,节点的路径管理进程负责本节点扩展路由表的多路径状态管理,并在网络出现链路故障时选择可用路径代替当前的失效路径。分析表明,本文提出的容错路由方法具有实现代价低、可扩展性高且不会导致死锁问题等优点。Fauh tolerant routing is an important approach to improve the usability of interconnection networks. Aiming at the source-routing fat tree, this paper proposes an endpoint dynamic fault tolerant routing approach. In the approach,a three level hierarchy is adopted for the routing storage,in which the RT (Routing Table) is stored in NIC (Network Interface Card) of the endpoint,the ERT (Extended RT) is stored in the memory of the endpoint, and the SERT (System ERT) is stored in the hard disk of the management server. Meanwhile, the path management process running in the endpoint is responsible for managing the state of multi-path maintained in the ERT of this endpoint, and replaces the current failed path with a chosen available path when a link fault occurs in the network. The primary analysis re- suits show that our proposed fault tolerant routing method has a low implementation cost and high scal- ability and cannot lead to deadlock problems.
分 类 号:TP393.06[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.189.192.24