一种基于节点多可用下一跳的分级收敛算法  

Hierarchy converging algorithm based on available multi-nexthop of node

作　　者：关礼安[1] 汪斌强[1] 朱宣勇[1] 

机构地区：[1]国家数字交换系统工程技术研究中心

出　　处：《计算机应用研究》2010年第9期3493-3495,共3页Application Research of Computers

基　　金：国家“863”计划资助项目(2008AA01A323);国家“973”计划资助项目(2007CB307102)

摘　　要：为了缩短网络的收敛时间,基于多径路由算法产生的节点多可用下一跳,提出了一种分级收敛算法。该算法将收敛划分为本节点收敛、上游邻接节点收敛和全网收敛三个等级,前两种收敛在保证报文正常转发的情况下不触发全网收敛。仿真结果表明,分级收敛算法能很好地缩短收敛时间,对于比较稀疏的网络,单链路故障触发的全网收敛虽不可避免,但仍有一定比例的链路故障只触发局部收敛,提高网络性能。For reducing convergence time,this paper proposed a hierarchy converging algorithm based on available multinexthop 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.

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

分 类 号：TP393[自动化与计算机技术—计算机应用技术]