Abstract
The Internet consists of many self-administered and inter-connected Autonomous Systems (ASms). ASms exchange inter-AS routing information with each other via the Border Gateway Protocol (BGP). Neighboring BGP routers located in different ASms share their inter-AS routing information via external BGP (eBGP), whereas two routers in the same AS share their inter-AS routing information via internal BGP (iBGP).
From the paths received from its peers, each BGP router chooses the best path based on routing policies chosen locally at its own AS. Conflicting policies between different ASms may cause divergence problems in eBGP, i.e., permanent oscillations in the chosen path to the destination. On the other hand, divergence problems may also occur in iBGP. This is caused by the interaction of route-reflection clustering, which is a technique to improve the scalability of iBGP, and other factors, such as intra-AS link costs, among others. In this paper, we provide a comprehensive solution that avoids all the known anomalies with both eBGP and iBGP. In our solution, each AS can locally choose its routing policies, while still ensuring anomaly-free behavior.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Rekhter, Y., Li, T.: A border gateway protocol. IETF RFC-1771 (1995)
Griffin, T.G., Shepherd, F.B., Wilfong, G.: Policy disputes in path vector protocols. In: Proc. of IEEE ICNP conference, pp. 21–30 (1999)
Bates, T., Chandrasekeran, R.: BGP route reflection - an alternative to full-mesh IBGP. IETF RFC-1966 (1996)
Govindan, R., Alaettinoglu, C., Eddy, G., Kessens, D., Kumar, S., Lee, W.S.: An architecture for stable, analyzable Internet routing. IEEE Network 13(1), 29–35 (1999)
Griffin, T.G., Shepherd, F.B., Wilfong, G.: The stable paths problem and interdomain routing. IEEE/ACM Trans. Networking 10(2), 232–243 (2002)
Gao, L., Rexford, J.: Stable Internet routing without global coordination. IEEE/ACM Trans. Networking 9(6), 681–692 (2001)
Basu, A., Ong, C.-H.L., Rasala, A., Shepherd, F.B., Wilfong, G.: Route oscillations in IBGP with route reflection. In: Proc. of ACM SIGCOMM conference, pp. 235–247 (2002)
Walton, D., Cook, D., Retana, A., Scudder, J.: BGP persistent route oscillation solution. IETF Internet Draft (2002)
Griffin, T.G., Wilfong, G.: On the correctness of IBGP configuration. In: Proc. of ACM SIGCOMM conference, pp. 17–29 (2002)
Griffin, T.G., Wilfong, G.: Analysis of the MED oscillation problem in BGP. In: Proc. of IEEE ICNP conference, pp. 90–99 (2002)
Cobb, J.A., Musunuri, R.: Convergence of inter-domain routing. In: Proc. of IEEE GLOBECOM conference, pp. 1353–1358 (2004)
Musunuri, R., Cobb, J.A.: Convergence of IBGP. In: Proc. of IEEE ICON Conference (2004)
Gouda, M.G.: Elements of Network Protocol Design. John Wiley & Sons, England (1998)
Gouda, M.G.: Protocol verification made simple: A tutorial. Comput. Netw. ISDN Syst. 25(9), 969–980 (1993)
Musunuri, R., Cobb, J.A.: Complete solution to IBGP stability. In: Proc. of IEEE ICC conference, vol. 2, pp. 1177–1181 (2004)
Griffin, T.G., Shepherd, F.B., Wilfong, G.: A safe path vector protocol. In: Proc. of INFOCOM conference, pp. 490–499 (2000)
Arora, A., Gouda, M.G.: Distributed reset. IEEE Trans. Comput. 43(9), 1026–1038 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Musunuri, R., Cobb, J.A. (2005). Comprehensive Solution for Anomaly-Free BGP. In: Magedanz, T., Madeira, E.R.M., Dini, P. (eds) Operations and Management in IP-Based Networks. IPOM 2005. Lecture Notes in Computer Science, vol 3751. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11567486_14
Download citation
DOI: https://doi.org/10.1007/11567486_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29356-9
Online ISBN: 978-3-540-32096-8
eBook Packages: Computer ScienceComputer Science (R0)