Complexity of network synchronization
Journal of the ACM (JACM)
Interconnections: bridges and routers
Interconnections: bridges and routers
An analysis of BGP convergence properties
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Stable Internet routing without global coordination
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Delayed Internet routing convergence
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
On inferring autonomous system relationships in the internet
IEEE/ACM Transactions on Networking (TON)
Internet Routing Architectures
Internet Routing Architectures
Route flap damping exacerbates internet routing convergence
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
An Experimental Analysis of BGP Convergence Time
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
On inferring and characterizing internet routing policies
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
Locating internet routing instabilities
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
A measurement framework for pin-pointing routing changes
Proceedings of the ACM SIGCOMM workshop on Network troubleshooting: research, theory and operations practice meet malfunctioning reality
A Stability-Oriented Approach to Improving BGP Convergence
SRDS '04 Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems
Brief announcement: continuous containment and local stabilization in path-vector routing
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
DIMES: let the internet measure itself
ACM SIGCOMM Computer Communication Review
An analysis of convergence delay in path vector routing protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
Internet resiliency to attacks and failures under BGP policy routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Finding a needle in a haystack: pinpointing significant BGP routing changes in an IP network
NSDI'05 Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation - Volume 2
Bringing order to BGP: decreasing time and message complexity
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
BGP-RCN: improving BGP convergence through root cause notification
Computer Networks: The International Journal of Computer and Telecommunications Networking
BGP routing policies in ISP networks
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
The Border Gateway Protocol (BGP), the de facto routing protocol of the internet, generates excessive amount of traffic following changes in the underlying backbone. Previous papers [C. Labovitz, R. Wattenhofer, S. Venkatachary, A. Ahuja, The impact of internet policy and topology on delayed routing convergence, in: Proceedings of the INFOCOM, April 2001; C. Labovitz, A. Ahuja, A. Bose, F. Jahanianitz, Delayed internet routing convergence, in: Sigcomm, September 2000.] show that BGP suffers from high convergence delay and high message complexity after a fail down (detachment) of a network, due to path exploration caused by a limited version of the counting to infinity problem. Surprisingly, we show in this paper that BGP suffers from a high message complexity also after an up event (reattachment of a network). We analyze BGP dynamics data from raw update dumps and show that race conditions cause extensive path exploration that increases the amount of redundant updates. We show, based on these BGP dynamics, that up to 26% of the updates sent during up events are redundant. We also find that the effect of this phenomenon is bigger when the change occurs at the edge of the network. We suggest a minor modification to the waiting rule of BGP that pseudo orders the network and reduces the convergence latency of up events by half and the message complexity from O(DE) to O(E), where D is the Diameter of the internet and E is the number of connections between ASes. Our simulation results suggest that our modification may improve the convergence messages and time during all events, with the most noted improvement of up to 36% in the number of messages and 81% in time to convergence during up events in Internet like topologies. We show that our results hold also for partial deployment of the modification in only some of the routers.