Abstract
Internet routers’ forwarding tables (FIBs), which must be stored in expensive fast memory for high-speed packet forwarding, are growing quickly in size due to increased multihoming, finer-grained traffic engineering, and deployment of IPv6 and VPNs. To address this problem, several Internet architectures have been proposed to reduce FIB size by returning to the earlier approach of route caching: storing only the working set of popular routes in the FIB. This paper revisits route caching. We build upon previous work by studying flat, uni-class (/24) prefix caching, with modern traffic traces from more than 60 routers in a tier-1 ISP. We first characterize routers’ working sets and then evaluate route-caching performance under different cache replacement strategies and cache sizes. Surprisingly, despite the large number of deaggregated /24 subnets, caching uni-class prefixes can effectively curb the increase of FIB sizes. Moreover, uni-class prefixes substantially simplify a cache design by eliminating longest-prefix matching, enabling FIB design with slower memory technologies. Finally, by comparing our results with previous work, we show that the distribution of traffic across prefixes is becoming increasingly skewed, making route caching more appealing.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Chang, E., Lu, B., Markhovsky, F.: RLDRAMs vs. CAMs/SRAMs: Part 1, http://www.commsdesign.com/design_corner/OEG20030603S0007
How to Choose the Best Router Switching Path for Your Network. Cisco Systems (August 2005), http://www.cisco.com/warp/public/105/20.pdf
Partridge, C., Carvey, P., et al.: A 50-Gb/s IP router. IEEE/ACM Trans. Networking (1998)
Ballani, H., Francis, P., Cao, T., Wang, J.: Making Routers Last Longer with ViAggre. In: Proc. NSDI (April 2009) (to appear)
Kim, C., Caesar, M., Rexford, J.: Floodless in SEATTLE: A Scalable Ethernet Architecture for Large Enterprises. In: Proc. SIGCOMM (August 2008)
Caesar, M., Condie, T., Kannan, J., Lakshminarayanan, K., Stoica, I.: ROFL: Routing on Flat Labels. In: Proc. ACM SIGCOMM (September 2006)
Farinacci, D., Fuller, V., Oran, D., Meyer, D., Brim, S.: Locator/ID Separation Protocol (LISP). Internet-Draft (work in progress) (December 2008)
Andersen, D., Balakrishnan, H., Feamster, N., et al.: Accountable Internet Protocol (AIP). In: Proc. ACM SIGCOMM (2008)
Chang, D., Govindan, R., Heidemann, J.: An empirical study of router response to large BGP routing table load. In: Proc. Internet Measurement Workshop (2002)
Eatherton, W., Varghese, G., Dittia, Z.: Tree bitmap: Hardware/Software IP Lookups with Incremental Updates. In: ACM Computer Communication Review (2004)
Sampled NetFlow, Cisco Systems, http://www.cisco.com/en/US/docs/ios/12_0s/feature/guide/12s_sanf.html
Liu, H.: Routing Prefix Caching in Network Processor Design. In: Proc. International Conference on Computer Communications and Networks (October 2001)
Feldmeier, D.: Improving Gateway Performance With a Routing-table Cache. In: Proc. IEEE INFOCOM (1988)
Rexford, J., Wang, J., Xiao, Z., Zhang, Y.: BGP Routing Stability of Popular Destinations. In: Proc. Internet Measurement Workshop (November 2002)
Jain, R.: Characteristics of Destination Address Locality in Computer Networks: A Comparison of Caching Schemes. Computer Networks and ISDN 18, 243–254 (1989/1990)
McRobb, D.: Path and Round Trip Time Measurements (slides 19-21), http://www.caida.org/publications/presentations/nanog9806/index.html
Iannone, L., Bonaventure, O.: On the Cost of Caching Locator/ID Mappings. In: Proc. ACM CoNEXT (December 2007)
Partridge, C.: Locality and Route Caches (1996), http://www.caida.org/workshops/isma/9602/positions/partridge.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kim, C., Caesar, M., Gerber, A., Rexford, J. (2009). Revisiting Route Caching: The World Should Be Flat. In: Moon, S.B., Teixeira, R., Uhlig, S. (eds) Passive and Active Network Measurement. PAM 2009. Lecture Notes in Computer Science, vol 5448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00975-4_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-00975-4_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00974-7
Online ISBN: 978-3-642-00975-4
eBook Packages: Computer ScienceComputer Science (R0)