Revisiting BGP churn growth

  • Authors:
  • Ahmed Elmokashfi;Amogh Dhamdhere

  • Affiliations:
  • Simula Research Lab, Oslo, Norway;CAIDA / UC San Diego, San Diego, CA, USA

  • Venue:
  • ACM SIGCOMM Computer Communication Review
  • Year:
  • 2013

Quantified Score

Hi-index 0.00

Visualization

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.