PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric
Journal of the ACM (JACM)
BGP routing stability of popular destinations
Proceedings of the 2nd ACM SIGCOMM Workshop on Internet measurment
Efficient prefix cache for network processors
HOTI '04 Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium
Revisiting Route Caching: The World Should Be Flat
PAM '09 Proceedings of the 10th International Conference on Passive and Active Network Measurement
On the aggregatability of router forwarding tables
INFOCOM'10 Proceedings of the 29th conference on Information communications
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
Dynamics of prefix usage at an edge router
PAM'11 Proceedings of the 12th international conference on Passive and active measurement
SMALTA: practical and near-optimal FIB aggregation
Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies
Catching popular prefixes at AS border routers with a prediction based method
Computer Networks: The International Journal of Computer and Telecommunications Networking
Compressing IP forwarding tables: towards entropy bounds and beyond
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
ndn||mem: an architecture to alleviate the memory bottleneck for named data networking
Proceedings of the 2013 workshop on Student workhop
| Hi-index | 0.00 |
The size of the global Routing Information Base (RIB) has been increasing at an alarming rate. This directly leads to the rapid growth of the global Forwarding Information Base (FIB) size, which raises serious concerns for ISPs as the FIB memory in line cards is much more expensive than regular memory modules and it is very costly to increase this memory capacity frequently for all the routers in an ISP. One potential solution is to install only the most popular FIB entries into the fast memory (i.e., a FIB cache), while storing the complete FIB in slow memory. In this paper, we propose an effective FIB caching scheme that achieves a considerably higher hit ratio than previous approaches while preventing the cache-hiding problem. Our experimental results show that with only 20K prefixes in the cache (5.36% of the actual FIB size), the hit ratio of our scheme is higher than 99.95%. Our scheme can also handle cache misses, cache replacement and routing updates efficiently.