Delayed Internet routing convergence
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
On the correctness of IBGP configuration
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Route flap damping exacerbates internet routing convergence
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Route oscillations in I-BGP with route reflection
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Analysis of the MED Oscillation Problem in BGP
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
An Experimental Analysis of BGP Convergence Time
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Network sensitivity to hot-potato disruptions
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A measurement study on the impact of routing events on end-to-end internet path performance
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
BGP churn evolution: a perspective from the core
INFOCOM'10 Proceedings of the 29th conference on Information communications
Investigating occurrence of duplicate updates in BGP announcements
PAM'10 Proceedings of the 11th international conference on Passive and active measurement
| Hi-index | 0.00 |
The Border Gateway Protocol (BGP), the de facto inter-domain routing protocol of the Internet, is known to be noisy. The protocol has two main mechanisms to ameliorate this, MinRouteAdvertisementInterval (MRAI), and Route Flap Damping (RFD). MRAI deals with very short bursts on the order of a few to 30 seconds. RFD deals with longer bursts, minutes to hours. Unfortunately, RFD was found to severely penalize sites for being well-connected because topological richness amplifies the number of update messages exchanged. So most operators have disabled it. Through measurement, this paper explores the avenue of absolutely minimal change to code, and shows that a few RFD algorithmic constants and limits can be trivially modified, with the result being damping a non-trivial amount of long term churn without penalizing well-behaved prefixes' normal convergence process.