Skip to main content

From ISP Address Announcement Patterns to Routing Scalability

  • Conference paper
  • 1127 Accesses

Part of the Lecture Notes in Computer Science book series (LNCCN,volume 7189)

Abstract

The Internet routing table size has been growing rapidly. In future Internet, if given a much larger public address space (e.g., IPv6), the potential expansion can be very significant, and the cost of a large routing table will affect many ISPs. Before devising methods to ensure routing scalability, it is necessary to understand what factors lead to the expansion of routing tables and to what extent they impact. In addition to the well known factors such as multi-homing, traffic engineering and non-contiguous address allocations, the tendency towards convenient address management also increases the routing table size. In this paper, we take a measurement-based approach to examine quantitatively how various factors, especially the current address aggregation status of different types of ISPs, contribute to the growth of global routing table. We show how these patterns affect the routing scalability, and discuss the implications as we plan address management and routing for the future Internet.

Keywords

  • Internet Service Provider
  • Scalability Issue
  • IPv4 Address
  • Address Allocation
  • Network Information Center

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   69.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Networktools (July 2011), http://www.networktools.nl/

  2. Bu, T., Gao, L., Towsley, D.: On characterizing BGP routing table growth. Computer Networks 45(1), 45–54 (2004)

    CrossRef  Google Scholar 

  3. Dimitropoulos, X., Krioukov, D., Riley, G.: Revealing the autonomous system taxonomy: The machine learning approach. In: PAM Workshop (2006)

    Google Scholar 

  4. Meng, X., Xu, Z., Zhang, B., Huston, G., Lu, S., Zhang, L.: IPv4 address allocation and the BGP routing table evolution. ACM SIGCOMM CCR 35(1), 71–80 (2005)

    CrossRef  Google Scholar 

  5. Meyer, D., Zhang, L., Fall, K.: Report from the IAB Workshop on Routing and Addressing. RFC 4984, IETF (September 2007)

    Google Scholar 

  6. Yin, X., Wu, X., Chon, J., Wang, Z.: ISPSG: Internet Service Provider-Separated Geographic-Based Addressing and Routing. In: IEEE GLOBECOM Workshops (2009)

    Google Scholar 

  7. Zhao, X., Liu, Y., Wang, L., Zhang, B.: On the Aggregatability of Router Forwarding Tables. In: IEEE INFOCOM (2010)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Chen, L., Shi, X., Chiu, D.M. (2012). From ISP Address Announcement Patterns to Routing Scalability. In: Pescapè, A., Salgarelli, L., Dimitropoulos, X. (eds) Traffic Monitoring and Analysis. TMA 2012. Lecture Notes in Computer Science, vol 7189. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-28534-9_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-28534-9_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-28533-2

  • Online ISBN: 978-3-642-28534-9

  • eBook Packages: Computer ScienceComputer Science (R0)