research-article

On the stability of interdomain routing

Authors:

Luca Cittadini,

Giuseppe Di Battista,

Massimo RimondiniAuthors Info & Claims

ACM Computing Surveys (CSUR), Volume 44, Issue 4

Article No.: 26, Pages 1 - 40

https://doi.org/10.1145/2333112.2333121

Published: 07 September 2012 Publication History

Abstract

Most routing protocols guarantee convergence to a stable routing state. That is, in the absence of topology or configuration changes, each router will eventually find a stable route to any destination. However, this is not the case for policy-based routing protocols, for example, the BGP protocol used as a de facto standard for interdomain routing.

The interaction of not-so-complex BGP configurations can cause permanent oscillations of routing. Several models and algorithms have been proposed in the literature to study routing oscillations. This article surveys state-of-the-art contributions in this field, with a special emphasis on algorithmic and combinatorial aspects.

References

[1]

Ahronovitz, E., Konig, J.-C., and Saad, C. 2006. A distributed method for dynamic resolution of BGP oscillations. In Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS).

Digital Library

[2]

Alaettinoglu, C., Villamizar, C., Gerich, E., Kessens, D., Meyer, D., Bates, T., Karrenberg, D., and Terpstra, M. 1999. Routing Policy Specification Language (RPSL). IETF RFC 2622.

Digital Library

[3]

Basu, A., Ong, C.-H. L., Rasala, A., Shepherd, F. B., and Wilfong, G. 2002. Route oscillations in I-BGP with route reflection. In Proceedings of the Annual ACM Conference of the Special Interest Group on Data Communication (SIGCOMM).

Digital Library

[4]

Bates, T., Chandra, R., and Chen, E. 2000. BGP route reflection—An alternative to full mesh IBGP. IETF RFC 2796.

Digital Library

[5]

Bremler-Barr, A., Afek, Y., and Schwarz, S. 2003. Improved BGP convergence via ghost flushing. In Proceedings of the IEEE International Conference on Computer Communications (InfoCom).

[6]

Chau, C.-K. 2006. Policy-based routing with non-strict preferences. In Proceedings of the Annual ACM Conference of the Special Interest Group on Data Communication (SIGCOMM).

Digital Library

[7]

Chau, C.-K. 2008. A game-theoretical study of robust networked systems. IEEE J. Select. Areas Comm. 26, 7, 1250--1259.

Digital Library

[8]

Chau, C.-K., Crowcroft, J., Lee, K.-W., and Wong, S. H. Y. 2008. Inter-domain routing for mobile ad hoc networks. In Proceedings of the International Workshop on Mobility in the Evolving Internet Architecture (MobiArch).

Digital Library

[9]

Chau, C.-K., Gibbens, R., and Griffin, T. G. 2006. Towards a unified theory of policy-based routing. In Proceedings of the IEEE International Conference on Computer Communications (InfoCom).

[10]

Chiesa, M., Cittadini, L., Di Battista, G., and Vissicchio, S. 2011. Local transit policies and the complexity of BGP stability testing. In Proceedings of the IEEE International Conference on Computer Communications (InfoCom).

[11]

Cittadini, L., Di Battista, G., Erlebach, T., Patrignani, M., and Rimondini, M. 2010. Assigning AS relationships to satisfy the Gao-Rexford conditions. In Proceedings of the Annual International Conference on Network Protocols (ICNP).

Digital Library

[12]

Cittadini, L., Di Battista, G., and Rimondini, M. 2008a. How stable is stable in interdomain routing: Efficiently detectable oscillation-free configurations. Tech. rep. RT-DIA-132-2008, Dipartimento di Informatica e Automazione, Università degli Studi Roma Tre.

[13]

Cittadini, L., Di Battista, G., and Rimondini, M. 2008b. (Un)-stable routing in the Internet: A survey from the algorithmic perspective. In Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science (WG).

Digital Library

[14]

Cittadini, L., Di Battista, G., Rimondini, M., and Vissicchio, S. 2009. Wheel + ring = reel: The impact of route filtering on the stability of policy routing. In Proceedings of the Annual International Conference on Network Protocols (ICNP).

[15]

Cittadini, L., Rimondini, M., Corea, M., and Di Battista, G. 2009. On the feasibility of static analysis for BGP convergence. In Proceedings of the International Symposium on Integrated Network Management.

Digital Library

[16]

Cobb, J. A., Gouda, M. G., and Musunuri, R. 2003. A stabilizing solution to the stable path problem. In Proceedings of the International Symposium on Self-Stabilizing Systems.

Digital Library

[17]

Di Battista, G., Erlebach, T., Hall, A., Patrignani, M., Pizzonia, M., and Schank, T. 2007. Computing the types of the relationships between autonomous systems. IEEE/ACM Trans. Netw. 15, 2, 267--280.

Digital Library

[18]

Ee, C. T., Ramachandran, V., Chun, B.-G., Lakshminarayanan, K., and Shenker, S. 2007. Resolving inter-domain policy disputes. Tech. rep. UCB/EECS-2007-27, EECS Department, University of California, Berkeley.

[19]

Elmokashfi, A., Kvalbein, A., and Dovrolis, C. 2010a. BGP churn evolution: A perspective from the core. In Proceedings of the IEEE International Conference on Computer Communications (InfoCom).

Digital Library

[20]

Elmokashfi, A., Kvalbein, A., and Dovrolis, C. 2010b. On the scalability of BGP: The role of topology growth. In Proceedings of the ACM CoNEXT Conference.

[21]

Fabrikant, A. and Papadimitriou, C. 2008. The complexity of game dynamics: BGP oscillations, sink equilibria, and beyond. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).

Digital Library

[22]

Fabrikant, A., Syed, U., and Rexford, J. 2011. There's something about MRAI: Timing diversity can exponentially worsen BGP convergence. In Proceedings of the IEEE International Conference on Computer Communications (InfoCom).

[23]

Feamster, N., Balakrishnan, H., and Rexford, J. 2004. Some foundational problems in interdomain routing. In Proceedings of the Workshop on Hot Topics in Networks (HotNets).

[24]

Feamster, N., Johari, R., and Balakrishnan, H. 2005. Stable policy routing with provider independence. Tech. rep. MIT-LCS-TR-981, MIT.

[25]

Feamster, N., Johari, R., and Balakrishnan, H. 2007. Implications of autonomy for the expressiveness of policy routing. IEEE/ACM Trans. Netw. 15, 6, 1266--1279.

Digital Library

[26]

Feigenbaum, J., Sami, R., and Shenker, S. 2006. Mechanism design for policy routing. Distrib. Comput. 293--305.

Digital Library

[27]

Feigenbaum, J., Schapira, M., and Shenker, S. 2007. Distributed algorithmic mechanism design. In Algorithmic Game Theory, N. Nisan, T. Roughgarden, E. Tardos, and V. V. Vazirani, Eds. Cambridge University Press, New York, NY, 363--384.

[28]

Gao, L., Griffin, T., and Rexford, J. 2001. Inherently safe backup routing with BGP. In Proceedings of the IEEE International Conference on Computer Communications (InfoCom).

[29]

Gao, L. and Rexford, J. 2000. Stable Internet routing without global coordination. In Proceedings of SIGMETRICS.

Digital Library

[30]

Godfrey, P. B., Ganichev, I., Shenker, S., and Stoica, I. 2009. Pathlet routing. In Proceedings of the Annual ACM Conference of the Special Interest Group on Data Communication (SIGCOMM).

Digital Library

[31]

Griffin, T. G. 2010. The stratified shortest-paths problem. In Proceedings of the International Conference on Communication Systems and Networks (COMSNETS).

Digital Library

[32]

Griffin, T. and Huston, G. 2005. BGP wedgies. IETF RFC 4264.

[33]

Griffin, T. G., Jaggard, A. D., and Ramachandran, V. 2003. Design principles of policy languages for path vector protocols. In Proceedings of the Annual ACM Conference of the Special Interest Group on Data Communication (SIGCOMM).

Digital Library

[34]

Griffin, T. G., Shepherd, F. B., and Wilfong, G. 1999. Policy disputes in path-vector protocols. In Proceedings of the Annual International Conference on Network Protocols (ICNP).

Digital Library

[35]

Griffin, T. G., Shepherd, F. B., and Wilfong, G. 2002. The stable paths problem and interdomain routing. IEEE/ACM Trans. Netw. 10, 2, 232--243.

Digital Library

[36]

Griffin, T. G. and Sobrinho, J. L. 2005. Metarouting. In Proceedings of the Annual ACM Conference of the Special Interest Group on Data Communication (SIGCOMM).

Digital Library

[37]

Griffin, T. G. and Wilfong, G. 1999. An analysis of BGP convergence properties. In Proceedings of the Annual ACM Conference of the Special Interest Group on Data Communication (SIGCOMM).

Digital Library

[38]

Griffin, T. G. and Wilfong, G. 2002a. On the correctness of IBGP configuration. In Proceedings of the Annual ACM Conference of the Special Interest Group on Data Communication (SIGCOMM).

Digital Library

[39]

Griffin, T. G. and Wilfong, G. T. 2000. A safe path vector protocol. In Proceedings of the IEEE International Conference on Computer Communications (InfoCom).

[40]

Griffin, T. G. and Wilfong, G. T. 2002b. Analysis of the MED oscillation problem in BGP. In Proceedings of the Annual International Conference on Network Protocols (ICNP).

Digital Library

[41]

Gurney, A. J. T. and Griffin, T. G. 2010. Neighbor-specific BGP: An algebraic exploration. In Proceedings of the Annual International Conference on Network Protocols (ICNP).

Digital Library

[42]

Haxell, P. E. and Wilfong, G. T. 2008. A fractional model of the border gateway protocol (BGP). In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (SODA).

Digital Library

[43]

Huston, G. 2011. BGP routing table analysis reports. http://bgp.potaroo.net/.

[44]

Jaggard, A. D. and Ramachandran, V. 2004. Robustness of class-based path-vector systems. In Proceedings of the Annual International Conference on Network Protocols (ICNP).

Digital Library

[45]

Jaggard, A. D. and Ramachandran, V. 2005. Relating two formal models of path-vector routing. In Proceedings of the IEEE International Conference on Computer Communications (InfoCom).

[46]

Jaggard, A. D. and Ramachandran, V. 2006. Robust path-vector routing despite inconsistent route preferences. In Proceedings of the Annual International Conference on Network Protocols (ICNP).

Digital Library

[47]

Jaggard, A. D., Schapira, M., and Wright, R. N. 2011. Distributed computing with adaptive heuristics. In Proceedings of the Symposium on Innovations in Computer Science (ICS).

[48]

Kent, S., Lynn, C., Mikkelson, J., and Seo, K. 2000. Secure border gateway protocol (S-BGP). IEEE J. Select. Areas Comm. 18, 103--116.

Digital Library

[49]

Kintali, S. 2008. A distributed protocol for fractional stable paths problem. In Proceedings of the DIMACS/DyDAn Workshop on Secure Internet Routing.

[50]

Klockar, T. and Carr-Motyčková, L. 2004. Preventing oscillations in route reflector-based I-BGP. In Proceedings of the International Conference on Computer Communication Networks (ICCCN).

[51]

Kosub, S., Maass, M. G., and Täubig, H. 2006. Acyclic type-of-relationship problems on the Internet. In Proceedings of the Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN). Lecture Notes in Computer Science, vol. 4235, Springer-Verlag, Berlin, 98--111.

Digital Library

[52]

Levin, H., Schapira, M., and Zohar, A. 2008. Interdomain routing and games. In Proceedings of the Annual ACM Symposium on Theory of Computing (STOC).

Digital Library

[53]

Luo, J., Xie, J., Hao, R., and Li, X. 2002. An approach to accelerate convergence for path vector protocol. In Proceedings of the IEEE Conference and Exhibition on Global Telecommunications (GlobeCom).

[54]

Mao, Z. M., Govindan, R., Varghese, G., and Katz, R. H. 2002. Route flap damping exacerbates Internet routing convergence. In Proceedings of the Annual ACM Conference of the Special Interest Group on Data Communication (SIGCOMM).

Digital Library

[55]

Musunuri, R. and Cobb, J. A. 2004. A complete solution for IBGP stability. In Proceedings of the IEEE International Conference on Communications (ICC).

[56]

Pei, D., Zhao, X., Wang, L., Massey, D., Mankin, A., Wu, S. F., and Zhang, L. 2002. Improving BGP convergence through consistency assertions. In Proceedings of the IEEE International Conference on Computer Communications (InfoCom).

[57]

Rawat, A. and Shayman, M. A. 2006. Preventing persistent oscillations and loops in IBGP configuration with route reflection. Comput. Netw. 50, 18, 3642--3665.

Digital Library

[58]

Rekhter, Y., Li, T., and Hares, S. 2006. A border gateway protocol 4 (BGP-4). IETF RFC 4271.

[59]

Retana, A. and White, R. 2011. BGP Custom decision process. draft-retana-bgp-custom-decision-01.

[60]

Rexford, J., Wang, J., Xian, Z., and Zhang, Y. 2002. BGP routing stability of popular destinations. In Proceedings of the Internet Measurement Workshop (IMW).

Digital Library

[61]

RIPE NCC. 2011. Routing information service. http://www.ripe.net/ris/.

[62]

Sami, R., Schapira, M., and Zohar, A. 2009. Searching for stability in interdomain routing. In Proceedings of the IEEE International Conference on Computer Communications (InfoCom).

[63]

Sobrinho, J. L. 2005. An algebraic theory of dynamic network routing. IEEE/ACM Trans. Netw. 13, 5, 1160--1173.

Digital Library

[64]

Sobrinho, J. L. and Griffin, T. G. 2010. Routing in equilibrium. In Proceedings of the International Symposium on the Mathematical Theory of Networks and Systems (MTNS).

[65]

Suchara, M., Fabrikant, A., and Rexford, J. 2011. BGP safety with spurious updates. In Proceedings of the IEEE International Conference on Computer Communications (InfoCom).

[66]

University of Oregon. 2011. Route Views project. http://www.routeviews.org/.

[67]

Varadhan, K., Govindan, R., and Estrin, D. 2000. Persistent route oscillations in inter-domain routing. Comput. Netw. 32, 1, 1--16.

[68]

Wang, Y., Schapira, M., and Rexford, J. 2009. Neighbor-Specific BGP: More flexible routing policies while improving global stability. In Proceedings of SIGMETRICS.

Digital Library

[69]

Zhang, H., Arora, A., and Liu, Z. 2004. A stability-oriented approach to improving BGP convergence. In Proceedings of the IEEE International Symposium on Reliable Distributed Systems (SRDS).

Digital Library

[70]

Zhang, R. and Bartell, M. 2003. BGP Design and Implementation. Cisco Press, Indianapolis, IN.

Digital Library

Cited By

Mahdi MWalshe RFarrell SPandit H(2024)Comprehensive Review and Future Research Directions on ICT StandardisationInformation10.3390/info1511069115:11(691)Online publication date: 2-Nov-2024
https://doi.org/10.3390/info15110691
Cheng YLuo NZhang JAntonopoulos TPiskac RXiang Q(2021)Looking for the Maximum Independent Set: A New Perspective on the Stable Path ProblemIEEE INFOCOM 2021 - IEEE Conference on Computer Communications10.1109/INFOCOM42981.2021.9488682(1-10)Online publication date: 10-May-2021
https://doi.org/10.1109/INFOCOM42981.2021.9488682
Bu KLaird AYang YCheng LLuo JLi YRen K(2020)Unveiling the Mystery of Internet Packet ForwardingACM Computing Surveys10.1145/340979653:5(1-34)Online publication date: 28-Sep-2020
https://dl.acm.org/doi/10.1145/3409796
Show More Cited By

Index Terms

On the stability of interdomain routing
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems

Recommendations

The stable paths problem and interdomain routing

Dynamic routing protocols such as RIP and OSPF essentially implement distributed algorithms for solving the shortest paths problem. The border gateway protocol (BGP) is currently the only interdomain routing protocol deployed in the Internet. BGP does ...
On understanding transient interdomain routing failures

The convergence time of the interdomain routing protocol, BGP, can last as long as 30 minutes. Yet, routing behavior during BGP route convergence is poorly understood. During route convergence, an end-to-end Internet path can experience a transient loss ...
Implications of autonomy for the expressiveness of policy routing

Thousands of competing autonomous systems must cooperate with each other to provide global Internet connectivity. Each autonomous system (AS) encodes various economic, business, and performance decisions in its routing policy. The current interdomain ...

Comments

Information & Contributors

Information

Published In

cover image ACM Computing Surveys

ACM Computing Surveys Volume 44, Issue 4

August 2012

318 pages

ISSN:0360-0300

EISSN:1557-7341

DOI:10.1145/2333112

Issue’s Table of Contents

Copyright © 2012 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 September 2012

Accepted: 01 April 2011

Revised: 01 December 2010

Received: 01 May 2009

Published in CSUR Volume 44, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Funding Sources

Ministero dell'Istruzione, dell'Università e della Ricerca
Advanced tracking system in intermodel freight tarnsprotation

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
659
Total Downloads

Downloads (Last 12 months)14
Downloads (Last 6 weeks)2

Reflects downloads up to 25 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Mahdi MWalshe RFarrell SPandit H(2024)Comprehensive Review and Future Research Directions on ICT StandardisationInformation10.3390/info1511069115:11(691)Online publication date: 2-Nov-2024
https://doi.org/10.3390/info15110691
Cheng YLuo NZhang JAntonopoulos TPiskac RXiang Q(2021)Looking for the Maximum Independent Set: A New Perspective on the Stable Path ProblemIEEE INFOCOM 2021 - IEEE Conference on Computer Communications10.1109/INFOCOM42981.2021.9488682(1-10)Online publication date: 10-May-2021
https://doi.org/10.1109/INFOCOM42981.2021.9488682
Bu KLaird AYang YCheng LLuo JLi YRen K(2020)Unveiling the Mystery of Internet Packet ForwardingACM Computing Surveys10.1145/340979653:5(1-34)Online publication date: 28-Sep-2020
https://dl.acm.org/doi/10.1145/3409796
Sobrinho J(2017)Correctness of Routing Vector Protocols as a Property of Network CyclesIEEE/ACM Transactions on Networking (TON)10.1109/TNET.2016.256760025:1(150-163)Online publication date: 1-Feb-2017
https://dl.acm.org/doi/10.1109/TNET.2016.2567600
da Silva RSouza Mota E(2017)A Survey on Approaches to Reduce BGP Interdomain Routing Convergence Delay on the InternetIEEE Communications Surveys & Tutorials10.1109/COMST.2017.272238019:4(2949-2984)Online publication date: Dec-2018
https://doi.org/10.1109/COMST.2017.2722380

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents