Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1145/1544012.1544020acmconferencesArticle/Chapter ViewAbstractPublication PagesconextConference Proceedingsconference-collections
research-article

On the scalability of BGP: the roles of topology growth and update rate-limiting

Published: 09 December 2008 Publication History

Abstract

The scalability of BGP routing is a major concern for the Internet community. Scalability is an issue in two different aspects: increasing routing table size, and increasing rate of BGP updates. In this paper, we focus on the latter. Our objective is to characterize the churn increase experienced by ASes in different levels of the Internet hierarchy as the network grows. We look at several "what-if" growth scenarios that are either plausible directions in the evolution of the Internet or educational corner cases, and investigate their scalability implications. In addition, we examine the effect of the BGP update rate-limiting timer (MRAI), considering both major variations with which it has been deployed. Our findings explain the dramatically different impact of multi-homing and peering on BGP scalability, identify which topological growth scenarios will lead to faster churn increase, and emphasize the importance of not rate-limiting explicit withdrawals (despite what RFC-4271 recently required).

References

[1]
Quagga project website. http://www.quagga.net/.
[2]
SSFNet website. http://www.ssfnet.org/.
[3]
R. Albert and A. L. Barabasi. Statistical mechanics of complex networks. Reviews of Modern Physics, 74: 47, 2002.
[4]
A. L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286: 509--512, October 1999.
[5]
A. Broido, E. Nemeth, and k. claffy. Internet expansion, refinement, and churn. European Transactions on Telecommunications, January 2002.
[6]
T. Bu, L. Gao, and D. Towsley. On characterizing BGP routing table growth. Computer Networks, 45(1), May 2004.
[7]
H. Chang, S. Jamin, and W. Willinger. Internet Connectivity at the AS-level: An Optimization-Driven Modeling Approach. In ACM SIGCOMM Workshop on MoMeTools, 2003.
[8]
A. Dhamdhere and C. Dovrolis. Ten years in the evolution of the Internet ecosystem. In IMC 2008, 2008.
[9]
X. Dimitropoulos, D. Krioukov, A. Vahdat, and G. Riley. Graph annotations in modeling complex network topologies. arXiv: 0708.3879, 2008.
[10]
X. Dimitropoulos and G. Riley. Efficient large-scale BGP simulations. Elsevier Computer Networks, Special Issue on Network Modeling and Simulation, 50(12): 2013--2027, 2006.
[11]
M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology. In ACM SIGCOMM, pages 251--262, 1999.
[12]
Lixin Gao. On inferring autonomous system relationships in the Internet. IEEE/ACM Transactions on Networking (TON), 9(6), December 2001.
[13]
T. Griffin and B. Premore. An experimental analysis of BGP convergence time. In ICNP, 2001.
[14]
Y. He, S. V. Krishnamurthy, M. Faloutsos, and M. Chrobak. Policy-aware topologies for efficient inter-domain routing evaluations. In IEEE INFOCOM 2008 Mini-Conference, Phoenix, AZ, USA, April 2008.
[15]
G. Huston. The BGP instability report. http://bgpupdates.potaroo.net/.
[16]
G. Huston and G. Armitage. Projecting future IPv4 router requirements from trends in dynamic BGP behaviour. In ATNAC, Australia, December 2006.
[17]
D. Krioukov, k. claffy, K. Fall, and A. Brady. On compact routing for the Internet. Computer Communications Review, 37(3), July 2007.
[18]
C. Labovitz, A. Ahuja, A. Bose, and F. Jahanian. Delayed internet routing convergence. In ACM SIGCOMM, pages 175--187, August 2000.
[19]
C. Labovitz, A. Ahuja, R. Wattenhofer, and S. Venkatachary. The impact of Internet policy and topology on delayed routing convergence. In INFOCOM, Anchorage, AK, USA, April 2001.
[20]
C. Labovitz, G. Robert Malan, and F. Jahanian. Internet routing instability. SIGCOMM Comput. Commun. Rev., 27(4): 115--126, 1997.
[21]
J. Leskovec, J. Kleinberg, and C. Faloutsos. Graph Evolution: Densification and Shrinking Diameters. ACM Transactions on Knowledge Discovery from Data (ACM TKDD), 2007.
[22]
J. Li, M. Guidero, Z. Wu, E. Purpus, and T. Ehrenkranz. BGP routing dynamics revisited. Computer Communications Review, April 2007.
[23]
L. Li, D. Alderson, R. Tanaka, J. C. Doyle, and W. Willinger. Towards a theory of scale-free graphs: Definition, properties, and implications (extended version). Internet Mathematics, 2005.
[24]
D. Meyer, L. Zhang, and K. Fall. Report from the IAB workshop on routing and addressing. http://tools.ietf.org/id/draft-iab-raws-report-02.txt, April 2007.
[25]
R. Oliveira, B. Zhang, D. Pei, R. Izhak-Ratzin, and L. Zhang. Quantifying path exploration in the Internet. In IMC, Rio de Janeiro, Brazil, October 2006.
[26]
B. Quoitin and S. Uhlig. Modeling the routing of an autonomous system with C-BGP. IEEE Network, 19(6), November 2005.
[27]
Y. Rekhter and T. Li. A border gateway protocol 4 (BGP-4). RFC1771, March 1995.
[28]
Y. Rekhter, T. Li, and S. Hares. A border gateway protocol 4 (BGP-4). RFC4271, January 2006.
[29]
RIPE's Routing Information Service. http://www.ripe.net/ris/.
[30]
J. G. Scudder. {idr} re: {rrg} re: BGP path hunting, MRAI timer and path length damping. Message to the IDR mailing list, http://www1.ietf.org/mail-archive/web/idr/current/msg02415.html, June 2007.
[31]
G. Siganos, M. Faloutsos, and C. Faloutsos. The Evolution of the Internet: Topology and Routing. University of California, Riverside technical report, 2002.
[32]
L. Subramanian, M. Caesar, C. Tien Ee, M. Handley, Z. Morley Mao, S. Shenker, and I. Stoica. HLP: a next generation inter-domain routing protocol. In Proceedings SIGCOMM, pages 13--24, Philadelphia, USA, August 2005. ACM.
[33]
X. Zhao, B. Zhang, A. Terzis, D. Massey, and L. Zhang. The impact of link failure location on routing dynamics: A formal analysis. In ACM SIGCOMM Asia Workshop, April 2005.
[34]
S. Zhou and R. Mondragon. Accurately Modeling the Internet Topology. Physical Review E, vol. 70, 2004.

Cited By

View all
  • (2022)Adaptive One Memory Access Bloom FiltersIEEE Transactions on Network and Service Management10.1109/TNSM.2022.314543619:2(848-859)Online publication date: Jun-2022
  • (2020)Cuckoo Filters and Bloom Filters: Comparison and Application to Packet ClassificationIEEE Transactions on Network and Service Management10.1109/TNSM.2020.302468017:4(2690-2701)Online publication date: Dec-2020
  • (2019)PR-TCAM: Efficient TCAM Emulation on Xilinx FPGAs Using Partial ReconfigurationIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2019.290398027:8(1952-1956)Online publication date: Aug-2019
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
CoNEXT '08: Proceedings of the 2008 ACM CoNEXT Conference
December 2008
526 pages
ISBN:9781605582108
DOI:10.1145/1544012
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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 December 2008

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Acceptance Rates

Overall Acceptance Rate 198 of 789 submissions, 25%

Upcoming Conference

CoNEXT '24

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)3
  • Downloads (Last 6 weeks)1
Reflects downloads up to 24 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2022)Adaptive One Memory Access Bloom FiltersIEEE Transactions on Network and Service Management10.1109/TNSM.2022.314543619:2(848-859)Online publication date: Jun-2022
  • (2020)Cuckoo Filters and Bloom Filters: Comparison and Application to Packet ClassificationIEEE Transactions on Network and Service Management10.1109/TNSM.2020.302468017:4(2690-2701)Online publication date: Dec-2020
  • (2019)PR-TCAM: Efficient TCAM Emulation on Xilinx FPGAs Using Partial ReconfigurationIEEE Transactions on Very Large Scale Integration (VLSI) Systems10.1109/TVLSI.2019.290398027:8(1952-1956)Online publication date: Aug-2019
  • (2017)Spatio-Temporal Modeling of BGP Routing Table EvolutionProceedings of the 12th International Conference on Future Internet Technologies10.1145/3095786.3095794(1-7)Online publication date: 14-Jun-2017
  • (2017)I-SeismographIEEE/ACM Transactions on Networking10.1109/TNET.2017.274890225:6(3411-3426)Online publication date: 1-Dec-2017
  • (2017)Flexible Packet Matching with Single Double Cuckoo HashIEEE Communications Magazine10.1109/MCOM.2017.170013255:6(212-217)Online publication date: 2017
  • (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
  • (2016)On the feasibility of core-rooted path addressingNOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium10.1109/NOMS.2016.7502826(306-314)Online publication date: Apr-2016
  • (2016)It Bends But Would It Break? Topological Analysis of BGP Infrastructures in Europe2016 IEEE European Symposium on Security and Privacy (EuroS&P)10.1109/EuroSP.2016.39(423-438)Online publication date: Mar-2016
  • (2015)Analyzing the evolution and the future of the internet topology focusing on flow hierarchyJournal of Computer Networks and Communications10.1155/2015/7368702015(2-2)Online publication date: 1-Jan-2015
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media