DocumentCode
1885028
Title
Stabilizing BGP routing without harming convergence
Author
Wang, Xiaoqiang ; Bonaventure, Olivier ; Zhu, Peidong
Author_Institution
Sch. of Comput., Nat. Univ. of Defense Technol., Changsha, China
fYear
2011
fDate
10-15 April 2011
Firstpage
840
Lastpage
845
Abstract
RFD and MRAI are the only two built-in mechanisms in BGP router against unstable routes, they can however negatively impact the convergence. In this paper, we propose a churn aggregation approach CAGG to stabilize BGP routing without harming convergence. CAGG is based on the observation that AS PATH change is the dominant cause for BGP updates and only a small number of AS_PATHs are explored by each highly active prefix. A CAGG equipped router converts the multiple AS PATHs explored by a highly active prefix into an aggregated path, and propagates the aggregated path instead to reduce the number of resulted BGP updates from AS PATH changes. Our experiments with real BGP data show that CAGG can reduce as much as 50% of BGP updates, and 60% of BGP path exploration duration in its best case, while on average 28.1% and 32% respectively across 36 RouteViews monitors. Furthermore, CAGG is shown to perform better than both RFD and PED[1] in reducing BGP updates, path exploration duration and accelerating BGP convergence, at the cost of buffering around 5,000 AS_PATHs.
Keywords
convergence; telecommunication network routing; telecommunication standards; MRAI; RFD; built in mechanisms; churn aggregation; convergence; highly active prefix; multiple AS PATH; round flap damping; stabilizing BGP routing; Aggregates; Communities; Convergence; Delay; History; Monitoring; Routing; BGP; BGP Churn; Convergence; Interdomain Routing; MRAI; PED; RFD;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Communications Workshops (INFOCOM WKSHPS), 2011 IEEE Conference on
Conference_Location
Shanghai
Print_ISBN
978-1-4577-0249-5
Electronic_ISBN
978-1-4577-0248-8
Type
conf
DOI
10.1109/INFCOMW.2011.5928929
Filename
5928929
Link To Document