Delayed Internet routing convergence
IEEE/ACM Transactions on Networking (TON)
Stable internet routing without global coordination
IEEE/ACM Transactions on Networking (TON)
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
BGP routing stability of popular destinations
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
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
Implications of autonomy for the expressiveness of policy routing
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
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
Resolving inter-domain policy disputes
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Differentiated BGP Update Processing for Improved Routing Convergence
ICNP '06 Proceedings of the Proceedings of the 2006 IEEE International Conference on Network Protocols
Achieving sub-50 milliseconds recovery upon BGP peering link failures
IEEE/ACM Transactions on Networking (TON)
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Impact of hot-potato routing changes in IP networks
IEEE/ACM Transactions on Networking (TON)
Quantifying path exploration in the internet
IEEE/ACM Transactions on Networking (TON)
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
An analysis of convergence delay in path vector routing protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
BGP-RCN: improving BGP convergence through root cause notification
Computer Networks: The International Journal of Computer and Telecommunications Networking
An adaptive management approach to resolving policy conflicts
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
Designing distributed systems for heterogeneity
Designing distributed systems for heterogeneity
BGP add-paths: the scaling/performance tradeoffs
IEEE Journal on Selected Areas in Communications - Special issue title on scaling the internet routing system: an interim report
A distributed method for dynamic resolution of BGP oscillations
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
R-BGP: staying connected In a connected world
NSDI'07 Proceedings of the 4th USENIX conference on Networked systems design & implementation
The Journal of Supercomputing
An economic analysis of routing conflict and its resolution
Performance Evaluation
Hi-index | 0.00 |
The instability issues of the Border Gateway Protocol (BGP), such as route oscillations and path explorations, can decrease the performance of packet forwarding and place heavy workload on routers. While BGP instability has been extensively studied, existing solutions mainly solve individual instances of BGP instability. Thus, with the existing solutions, the route selection processes of ASes or routers may not realize the actual root cause of BGP instability and hence cannot effectively solve the BGP instability problem. In this paper, we propose a simple, integrated solution called stable BGP (stableBGP) that practically solve a general class of BGP instability issues, including route oscillations and path explorations. stableBGP seeks to adapt the route selection process to best address the root cause of route changes so that the route selection process can quickly stabilize. We formally prove that stableBGP can achieve BGP stability. Extensive simulation results show that in the link failure scenario, stableBGP significantly reduces the number of route changes, the convergence time, and the number of route update messages when compared to prior solutions. We also analyze the performance of stableBGP when it is partially deployed. Our work provides insights into developing a practical solution that addresses the BGP instability problem.