首页 | 本学科首页   官方微博 | 高级检索  
     

一种基于节点多可用下一跳的分级收敛算法*
引用本文:关礼安,汪斌强,朱宣勇. 一种基于节点多可用下一跳的分级收敛算法*[J]. 计算机应用研究, 2010, 27(9): 3493-3495. DOI: 10.3969/j.issn.1001-3695.2010.09.079
作者姓名:关礼安  汪斌强  朱宣勇
作者单位:国家数字交换系统工程技术研究中心,郑州,450002
基金项目:国家“863”计划资助项目(2008AA01A323);国家“973”计划资助项目(2007CB307102)
摘    要:为了缩短网络的收敛时间,基于多径路由算法产生的节点多可用下一跳,提出了一种分级收敛算法。该算法将收敛划分为本节点收敛、上游邻接节点收敛和全网收敛三个等级,前两种收敛在保证报文正常转发的情况下不触发全网收敛。仿真结果表明,分级收敛算法能很好地缩短收敛时间,对于比较稀疏的网络,单链路故障触发的全网收敛虽不可避免,但仍有一定比例的链路故障只触发局部收敛,提高网络性能。

关 键 词:多下一跳; 链路故障; 收敛; 路由; 网络

Hierarchy converging algorithm based on available multi-nexthop of node
GUAN Li-an,WANG Bin-qiang,ZHU Xuan-yong. Hierarchy converging algorithm based on available multi-nexthop of node[J]. Application Research of Computers, 2010, 27(9): 3493-3495. DOI: 10.3969/j.issn.1001-3695.2010.09.079
Authors:GUAN Li-an  WANG Bin-qiang  ZHU Xuan-yong
Affiliation:(National Digital Switching System Engineering & Technological Research Center, Zhengzhou 450002, China)
Abstract:For reducing convergence time, this paper proposed a hierarchy converging algorithm based on available multi-nexthop of node which built by multipath routing algotithm. Composed the converging process of three levels, the converging process of local, upstream adjacency node and complete network. For the converging process of local and upstream adjacency, if they ensured that packets were forwarded correctly and complete converging was restrained. Simulation results show that hierarchy converging algorithm reduces converging time greatly. Single link failure is inevitable for some sparse network, but there are still a proportion of link failures to arouse complete converging and improve the converging performance of network.
Keywords:multi-nexthop   link failure   converging   routing   networking
本文献已被 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号