A loop-free extended Bellman-Ford routing protocol without bouncing effect
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Delayed Internet routing convergence
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
The stable paths problem and interdomain routing
IEEE/ACM Transactions on Networking (TON)
Route flap damping exacerbates internet routing convergence
Proceedings of the 2002 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
Secure Border Gateway Protocol (S-BGP)
IEEE Journal on Selected Areas in Communications
Achieving sub-50 milliseconds recovery upon BGP peering link failures
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
An analysis of convergence delay in path vector routing protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
Quantifying path exploration in the internet
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
Computer Networks: The International Journal of Computer and Telecommunications Networking
Modified flap damping mechanism to improve inter-domain routing convergence
Computer Communications
Achieving sub-50 milliseconds recovery upon BGP peering link failures
IEEE/ACM Transactions on Networking (TON)
A study of end-to-end web access failures
CoNEXT '06 Proceedings of the 2006 ACM CoNEXT conference
Large-scale testing of the Internet's Border Gateway Protocol (BGP) via topological scale-down
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Consensus routing: the internet as a distributed system
NSDI'08 Proceedings of the 5th USENIX Symposium on Networked Systems Design and Implementation
Reliable interdomain routing through multiple complementary routing processes
CoNEXT '08 Proceedings of the 2008 ACM CoNEXT Conference
On the impact of routing matrix inconsistencies on statistical path monitoring in overlay networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Providing scalable NH-diverse iBGP route re-distribution to achieve sub-second switch-over time
Computer Networks: The International Journal of Computer and Telecommunications Networking
A technique for reducing BGP update announcements through path exploration damping
IEEE Journal on Selected Areas in Communications - Special issue title on scaling the internet routing system: an interim report
Hi-index | 0.00 |
This paper presents a new mechanism, called BGP with root cause notification (BGP-RCN), that provides an upper bound of O(d) on routing convergence delay for BGP, where d is the network diameter as measured by the number of AS hops. BGP-RCN lets each routing update message carry the information about the specific cause which triggered the update message. Once a node v receives the first update message triggered by a link failure, v can avoid using any paths that have been obsoleted by the same failure. The basic approach in BGP-RCN is applicable to path vector routing protocols in general. Our analysis and simulation show that BGP-RCN can achieve substantial reduction in both BGP convergence time and the total number of intermediate route changes.