一种互联网的稳定路由选择策略

摘要

Network failures always occur in Internet, however, Inter-domain routing, border gateway protocol (BGP) , can not well adapt to these failures. In general, BGP may suffer slow path exploration and usually cause extensive packet loss. Although several improved schemes are proposed, they introduce high computation complexity. To address this problem, we propose a stable BGP (sBGP) scheme. In sBGP, a heuristic algorithm is designed to choose the most stable route as the best route. Through the stable routing selection, routers can quickly identify valid route and eliminate slow path exploration, and resource consumption is effectively reduced. The analysis and simulation study shows that sBGP not only effectively improves the BGP convergence performance but also reduces the communications overheads during convergence.%互联网中网络故障频繁,域间路由协议(BGP)并不能很好地适应网络故障.一般情况下,域间路由协议会经历一个比较漫长的路由搜索过程,导致互联网中大量的数据包丢包.虽然目前已提出了很多改进的BGP算法,但这些算法复杂度非常高,给路由器增加很多额外的计算代价.为了解决这个问题,作者提出了一个稳定的域间路由选择算法sBGP.在sBGP中,当路由器收到由故障触发的路由通告后,采用启发式的路由选择算法选择目前可选的最稳定路由为最佳路由.通过稳定路由选择,路由器可以选择有效的稳定路由,以避免无效的路由搜索以及路由不断更新引入的路由器处理开销.分析和模拟实验表明sBGP不仅能够有效提高BGP的收敛性能,而且可以减少收敛过程中的通信开销.