Name prefix matching using bloom filter pre-searching

For the successful realization of content-centric network, it is essential to design an efficient forwarding engine that performs high-speed name lookup. This paper proposes the use of a hashing-based name prefix trie and a Bloom filter. In the proposed approach, an off-chip hash table storing the trie is accessed when the Bloom filter states that the node exists in the trie. In accessing the hash table depending on the result of a Bloom filter, we propose two algorithms that have different search strategies. The first algorithm accesses the hash table for every positive result in a Bloom filter, while the second algorithm firstly attempts to determine the longest matching length using Bloom filter queries. The simulation result shows that the proposed approach can provide the output face of each input name, with a single hash table access on average and with two hash table accesses in the worst-case.

[1]  Hyesook Lim,et al.  Hierarchical packet classification using a Bloom filter and rule-priority tries , 2010, Comput. Commun..

[2]  Diego Perino,et al.  A reality check for content centric networking , 2011, ICN '11.

[3]  Bin Liu,et al.  NameFilter: Achieving fast name lookup with low memory cost via applying two-stage Bloom filters , 2013, 2013 Proceedings IEEE INFOCOM.

[4]  Christian Esteve Rothenberg,et al.  Towards a new generation of information-oriented internetworking architectures , 2008, CoNEXT '08.

[5]  Bin Liu,et al.  Parallel Name Lookup for Named Data Networking , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[6]  Haoyu Song,et al.  Fast hash table lookup using extended bloom filter: an aid to network processing , 2005, SIGCOMM '05.

[7]  Hyesook Lim,et al.  New Approach for Efficient IP Address Lookup Using a Bloom Filter in Trie-Based Algorithms , 2016, IEEE Transactions on Computers.

[8]  Raouf Boutaba,et al.  A survey of naming and routing in information-centric networks , 2012, IEEE Communications Magazine.

[9]  Bin Liu,et al.  GPU-accelerated name lookup with component encoding , 2013, Comput. Networks.

[10]  NicolauAlexandru,et al.  On-chip vs. off-chip memory , 2000 .

[11]  Yang Li,et al.  A novel cache size optimization scheme based on manifold learning in Content Centric Networking , 2014, J. Netw. Comput. Appl..

[12]  Hyesook Lim,et al.  On Adding Bloom Filters to Longest Prefix Matching Algorithms , 2014, IEEE Transactions on Computers.

[13]  Liang Chang,et al.  Bloom filter-based workflow management to enable QoS guarantee in wireless sensor networks , 2014, J. Netw. Comput. Appl..

[14]  Hyesook Lim,et al.  Reducing False Positives of a Bloom Filter using Cross-Checking Bloom Filters , 2014 .

[15]  So-Yeon Kim,et al.  Tuple Pruning Using Bloom Filters for Packet Classification , 2009, IEEE Micro.

[16]  Van Jacobson,et al.  Networking named content , 2009, CoNEXT '09.

[17]  Hongke Zhang,et al.  Scalable Name Lookup with Adaptive Prefix Bloom Filter for Named Data Networking , 2014, IEEE Communications Letters.

[18]  Hyesook Lim,et al.  Name prefix matching using bloom filter pre-searching , 2015, 2015 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS).

[19]  Athanasios V. Vasilakos,et al.  Information centric network: Research challenges and opportunities , 2015, J. Netw. Comput. Appl..

[20]  Nikil D. Dutt,et al.  On-chip vs. off-chip memory: the data partitioning problem in embedded processor-based systems , 2000, TODE.

[21]  Bin Liu,et al.  Scalable Name Lookup in NDN Using Effective Name Component Encoding , 2012, 2012 IEEE 32nd International Conference on Distributed Computing Systems.

[22]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[23]  David E. Taylor,et al.  Longest prefix matching using bloom filters , 2006, TNET.

[24]  Lei Guo,et al.  NDNBrowser: An extended web browser for named data networking , 2015, J. Netw. Comput. Appl..

[25]  Hidenori Nakazato.  Information centric network , 2015 .

[26]  Won So,et al.  Named data networking on a router: Fast and DoS-resistant forwarding with hash tables , 2013, Architectures for Networking and Communications Systems.