%0 Journal Article
%T Hierarchy converging algorithm based on available multi-nexthop of node<br>一种基于节点多可用下一跳的分级收敛算法*
%A GUAN Li-an
%A WANG Bin-qiang
%A ZHU Xuan-yong
%A <br>关礼安
%A 汪斌强
%A 朱宣勇
%J 计算机应用研究
%D 2010
%I 
%X 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.
%K multi-nexthop
%K link failure
%K converging
%K routing
%K networking<br>多下一跳
%K 链路故障
%K 收敛
%K 路由
%K 网络
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=AE25182E4886D631B13A10CA8B4DDE39&yid=140ECF96957D60B2&vid=DB817633AA4F79B9&iid=9CF7A0430CBB2DFD&sid=F0BDA68D1A3A8A7D&eid=CDD52B7098BDEF47&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=8