Stabilizing BGP routing without harming convergence

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.

[1]  Yakov Rekhter,et al.  A Border Gateway Protocol 4 (BGP-4) , 1994, RFC.

[2]  Anja Feldmann,et al.  Locating internet routing instabilities , 2004, SIGCOMM 2004.

[3]  Nilesh Patel,et al.  Signal Strength Based Route Selection in MANETs , 2012 .

[4]  Lixia Zhang,et al.  Route flap damping with assured reachability , 2010, AINTEC.

[5]  Ramesh Govindan,et al.  BGP Route Flap Damping , 1998, RFC.

[6]  Ruibing Hao,et al.  An approach to accelerate convergence for path vector protocol , 2002, Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE.

[7]  Brighten Godfrey,et al.  Routing Tables: Is Smaller Really Much Better? , 2009, HotNets.

[8]  Gordon T. Wilfong,et al.  Analysis of the MED oscillation problem in BGP , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[9]  Christos H. Papadimitriou,et al.  The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond , 2008, SODA '08.

[10]  Daniel Massey,et al.  BGP-RCN: improving BGP convergence through root cause notification , 2005, Comput. Networks.

[11]  Grenville J. Armitage,et al.  A Technique for Reducing BGP Update Announcements through Path Exploration Damping , 2010, IEEE Journal on Selected Areas in Communications.

[12]  Daniel Behnen,et al.  Improving BGP Convergence Through Consistency Assertions , 2004 .

[13]  Yehuda Afek,et al.  Improved BGP convergence via ghost flushing , 2004, IEEE J. Sel. Areas Commun..

[14]  Ahmed Elmokashfi,et al.  On the scalability of BGP: the roles of topology growth and update rate-limiting , 2008, CoNEXT '08.

[15]  Timothy G. Griffin,et al.  An experimental analysis of BGP convergence time , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[16]  Lixia Zhang,et al.  Measurement of highly active prefixes in BGP , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[17]  Byung-Gon Chun,et al.  Resolving inter-domain policy disputes , 2007, SIGCOMM 2007.

[18]  Paul Jakma Revised Default Values for the BGP 'Minimum Route Advertisement Interval' , 2008 .

[19]  Jaideep Chandrashekar,et al.  Limiting path exploration in BGP , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[20]  Wei Sun,et al.  Differentiated BGP Update Processing for Improved Routing Convergence , 2006, Proceedings of the 2006 IEEE International Conference on Network Protocols.

[21]  Ramesh Govindan,et al.  Route flap damping exacerbates internet routing convergence , 2002, SIGCOMM 2002.

[22]  Lixin Gao,et al.  Path Diversity Aware Interdomain Routing , 2009, IEEE INFOCOM 2009.

[23]  Abhijit Bose,et al.  Delayed Internet routing convergence , 2000, SIGCOMM.