Computer Networks and ISDN Systems
IEEE/ACM Transactions on Networking (TON)
BGP routing stability of popular destinations
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
An empirical study of router response to large BGP routing table load
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Tree bitmap: hardware/software IP lookups with incremental updates
ACM SIGCOMM Computer Communication Review
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
On the cost of caching locator/ID mappings
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Floodless in seattle: a scalable ethernet architecture for large enterprises
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Accountable internet protocol (aip)
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Making routers last longer with ViAggre
NSDI'09 Proceedings of the 6th USENIX symposium on Networked systems design and implementation
Routing scalability: an operator's view
IEEE Journal on Selected Areas in Communications - Special issue title on scaling the internet routing system: an interim report
LISP-TREE: a DNS hierarchy to support the lisp mapping system
IEEE Journal on Selected Areas in Communications - Special issue title on scaling the internet routing system: an interim report
SEATTLE: A Scalable Ethernet Architecture for Large Enterprises
ACM Transactions on Computer Systems (TOCS)
Dynamics of prefix usage at an edge router
PAM'11 Proceedings of the 12th international conference on Passive and active measurement
A deep dive into the LISP cache and what ISPs should know about it
NETWORKING'11 Proceedings of the 10th international IFIP TC 6 conference on Networking - Volume Part I
Two-level cache architecture to reduce memory accesses for IP lookups
Proceedings of the 23rd International Teletraffic Congress
ReClick - A Modular Dataplane Design Framework for FPGA-Based Network Virtualization
Proceedings of the 2011 ACM/IEEE Seventh Symposium on Architectures for Networking and Communications Systems
Leveraging Zipf's law for traffic offloading
ACM SIGCOMM Computer Communication Review
Catching popular prefixes at AS border routers with a prediction based method
Computer Networks: The International Journal of Computer and Telecommunications Networking
An analytical model for the LISP cache size
IFIP'12 Proceedings of the 11th international IFIP TC 6 conference on Networking - Volume Part I
Supporting the Web with an information centric network that routes by name
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient FIB caching using minimal non-overlapping prefixes
ACM SIGCOMM Computer Communication Review
Caching Locator/ID mappings: An experimental scalability analysis and its implications
Computer Networks: The International Journal of Computer and Telecommunications Networking
FasTrak: enabling express lanes in multi-tenant data centers
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
Network virtualization in multi-tenant datacenters
NSDI'14 Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation
| Hi-index | 0.00 |
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.