Fit the elephant in a box - towards IP lookup at on-chip memory access speed

Fitting large and ever increasing routing tables in small on-chip memory is just like fitting an elephant in a box, which has been considered as impossible. In this paper, we propose the data structure of two-Dimensional Division Bloom Filter (D2BF) that can compactly encode almost all the needed information for performing IP lookup from a FIB in small on-chip memory. With pipelining, we further achieve the throughput of one packet per on-chip memory access.

[1]  Feng Wang,et al.  Matching the speed gap between SRAM and DRAM , 2008, 2008 International Conference on High Performance Switching and Routing.

[2]  Qi Li,et al.  Guarantee IP lookup performance with FIB explosion , 2014, SIGCOMM.

[3]  Gaogang Xie,et al.  A Shifting Bloom Filter Framework for Set Queries , 2015, Proc. VLDB Endow..

[4]  Haoyu Song,et al.  LOOP: Layer-based overlay and optimized polymerization for multiple virtual tables , 2013, 2013 21st IEEE International Conference on Network Protocols (ICNP).

[5]  Bin Liu,et al.  CLUE: Achieving Fast Update over Compressed Table for Parallel Lookup with Reduced Dynamic Redundancy , 2012, 2012 IEEE 32nd International Conference on Distributed Computing Systems.

[6]  Songwu Lu,et al.  IPv4 address allocation and the BGP routing table evolution , 2005, CCRV.

[7]  Bin Liu,et al.  An ultra-fast universal incremental update algorithm for trie-based routing lookup , 2012, 2012 20th IEEE International Conference on Network Protocols (ICNP).

[8]  Sarang Dharmapurikar,et al.  Longest prefix matching using bloom filters , 2006, IEEE/ACM Transactions on Networking.

[9]  Shigang Chen,et al.  One memory access bloom filters and their generalization , 2011, 2011 Proceedings IEEE INFOCOM.