skip to main content
research-article

Revisiting BGP churn growth

Published:31 December 2013Publication History
Skip Abstract Section

Abstract

In the mid 2000s there was some concern in the research and operational communities over the scalability of BGP, the Internet's interdomain routing protocol. The focus was on update churn (the number of routing protocol messages that are exchanged when the network undergoes routing changes) and whether churn was growing too fast for routers to handle. Recent work somewhat allayed those fears, showing that update churn grows slowly in IPv4, but the question of routing scalability has re-emerged with IPv6.

In this work, we develop a model that expresses BGP churn in terms of four measurable properties of the routing system. We show why the number of updates normalized by the size of the topology is constant, and why routing dynamics are qualitatively similar in IPv4 and IPv6. We also show that the exponential growth of IPv6 churn is entirely expected, as the underlying IPv6 topology is also growing exponentially.

References

  1. S. Agarwal, C.-N. Chuah, S. Bhattacharyya, and C. Diot. Impact of BGP Dynamics on Router CPU Utilization. In Proc. Passive and Active Measurement Conference, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  2. A. Broido and k. claffy. Analysis of RouteViews BGP data: policy atoms. In Network Resource Data Management Workshop, Santa Barbara, CA, May 2001.Google ScholarGoogle Scholar
  3. L. Cittadini, W. Muhlbauer, S. Uhlig, R. Bush, P. Francois, and O. Maennel. Evolution of Internet address space deaggregation: Myths and reality. IEEE Journal on Selected Areas in Communications, 28(8), 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. A. Dhamdhere and C. Dovrolis. Twelve years in the evolution of the Internet ecosystem. IEEE/ACM Transactions on Networking, 19(5), Oct. 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. A. Dhamdhere, M. Luckie, B. Huffaker, A. Elmokashfi, E. Aben, and K. Claffy. Measuring the Deployment of IPv6: Topology, Routing and Performance. In Proc. of ACM SIGCOMM IMC, Nov 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. A. Elmokashfi, A. Kvalbein, and C. Dovrolis. On the Scalability of BGP: the roles of topology growth and update rate-limiting. In Proc. ACM CoNEXT, Dec 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. A. Elmokashfi, A. Kvalbein, and C. Dovrolis. BGP churn evolution: A perspective from the core. IEEE/ACM Transactions on Networking, 20(2), April 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. T. Griffin and G. Wilfong. An Analysis of BGP Convergence Properties. In Proc. ACM SIGCOMM, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Hollander and D. A. Wolfe. Nonparametric statistical methods. Wiley, second edition, 1999.Google ScholarGoogle Scholar
  10. G. Huston. The BGP instability report. http://bgpupdates.potaroo.net/.Google ScholarGoogle Scholar
  11. G. Huston. BGP in 2009 (and a bit of 2010). Presentation at ARIN XXV meeting, 2010.Google ScholarGoogle Scholar
  12. G. Huston. The BGP World is Flat, Nov. 2011. http://www.potaroo.net/ispcol/2011--12/flat.html.Google ScholarGoogle Scholar
  13. G. Huston and G. Armitage. Projecting future IPv4 router requirements from trends in dynamic BGP behaviour. In Proc. ATNAC, Australia, Dec 2006.Google ScholarGoogle Scholar
  14. C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian. Delayed Internet Routing Convergence. IEEE/ACM Transactions on Networking, 9(3), June 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. C. Labovitz, G. R. Malan, and F. Jahanian. Origins of Internet routing instability. In Proc. IEEE INFOCOM, 1999.Google ScholarGoogle ScholarCross RefCross Ref
  16. J. Li, M. Guidero, Z. Wu, E. Purpus, and T. Ehrenkranz. BGP routing dynamics revisited. Computer Communications Review, apr 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. D. Meyer, L. Zhang, and K. Fall. Report from the IAB workshop on routing and addressing. RFC 4984, 2007.Google ScholarGoogle Scholar
  18. R. Oliveira, R. Izhak-Ratzin, B. Zhang, and L. Zhang. Measurement of highly active prefixes in BGP. In Proc. IEEE GLOBECOMM, 2005.Google ScholarGoogle ScholarCross RefCross Ref
  19. R. Oliveira, B. Zhang, D. Pei, R. Izhak-Ratzin, and L. Zhang. Quantifying Path Exploration in the Internet. In Proc. ACM SIGCOMM IMC, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. N. Valler, M. Butkiewicz, B. Prakash, and M. Faloutsos. Non-binary information propagation: Modeling BGP routing churn. In Proc. IEEE INFOCOM Compter Communications Workshop, 2011.Google ScholarGoogle ScholarCross RefCross Ref
  21. J. Wu, Z. M. Mao, J. Rexford, and J. Wang. Finding a needle in a haystack: pinpointing significant BGP routing changes in an IP network. In Proc. USENIX NSDI, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. B. Zhang, V. Kambhampati, M. Lad, D. Massey, and L. Zhang. Identifying BGP routing table transfers. In Proc. ACM SIGCOMM workshop on Mining network data, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. X. Zhao, D. Massey, M. Lad, and L. Zhang. On/Off Model: A New Tool to Understand BGP Update Burst. University of California, Los Angeles technical report, 2004.Google ScholarGoogle Scholar
  24. X. Zhao, B. Zhang, D. Massey, A. Terzis, and L. Zhang. The impact of link failure location on routing dynamics: A formal analysis. In Proc. ACM SIGCOMM Asia Workshop, 2005.Google ScholarGoogle Scholar

Index Terms

  1. Revisiting BGP churn growth

    Recommendations

    Comments

    Login options

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

    Sign in

    Full Access

    • Published in

      cover image ACM SIGCOMM Computer Communication Review
      ACM SIGCOMM Computer Communication Review  Volume 44, Issue 1
      January 2014
      61 pages
      ISSN:0146-4833
      DOI:10.1145/2567561
      Issue’s Table of Contents

      Copyright © 2013 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: 31 December 2013

      Check for updates

      Qualifiers

      • research-article

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader