Name prefix matching using bloom filter pre-searching

Abstract

As a new networking paradigm for future Internet, content centric networking (CCN) technology provides a contents-oriented communication infrastructure for the rapidly increasing amount of data traffic. For the successful realization of CCN, 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 nodes of the name prefix trie is only accessed when the Bloom filter states that the node under querying exists in the trie. In accessing the node depending on the result of the Bloom filter, we propose two algorithms that have different strategies. The first algorithm accesses the trie node for every positive result of the Bloom filter, while the second algorithm first attempts to determine the longest matching length using Bloom filter queries. Trie nodes are accessed from the possible longest length, and tracked back if there is no match. Simulation results show that the proposed approach can provide the output face of each input name, with a single node access on average and with two node accesses in the worst-case using a reasonable size of a Bloom filter.

Search mechanism for data contents based on bloom filter and tree hybrid structure in system wide information management

“…The function and configuration of each server in the experimental environment are briefly introduced below [36]. The airline's access server is responsible for connecting its internal flight, dispatch, and technical support departments [37]. It provides SWIM systems with the flight plan information formulated by the dispatch department and transmits access information for such information to authorized servers [38].…”