Name Prefix Matching Using Bloom Filter Pre-Searching

Abstract

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.