摘要： 针对Internet域间路由慢收敛问题，提出基于简单路径向量协议(SPVP)的BGP路由收敛算法。分析该算法在4种全接连网络拓扑中的Tdown收敛边界值得出，通过检测域间失效链路的根源节点能有效减少路由收敛时间和更新消息开销。SSFNet仿真结果表明，该算法收敛时间上限为O(d)。

关键词: 域间路由, 边界网关协议, 收敛时间, 简单路径向量协议

Abstract: Aiming at the slow convergence problem of Internet inter-domain routing, this paper proposes a Border Gateway Protocol(BGP) routing convergence algorithm based on Simple Path Vector Protocol(SPVP). It detects the root-cause node in inter-domain link failure to improve the convergence speed of inter-domain routing and reduce the overhead of routing update message with the analysis of four different Tdown convergence boundary value in full mesh network topologies. SSFNet simulation results show that convergence upper limit of this algorithm is O(d).

Key words: inter-domain routing, Border Gateway Protocol(BGP), convergence time, Simple Path Vector Protocol(SPVP)

中图分类号: 

• TP393