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.
|Title of host publication||ANCS 2015 - 11th 2015 ACM/IEEE Symposium on Architectures for Networking and Communications Systems|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|Number of pages||2|
|State||Published - 18 May 2015|
|Event||11th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2015 - Oakland, United States|
Duration: 7 May 2015 → 8 May 2015
|Name||ANCS 2015 - 11th 2015 ACM/IEEE Symposium on Architectures for Networking and Communications Systems|
|Conference||11th ACM/IEEE Symposium on Architectures for Networking and Communications Systems, ANCS 2015|
|Period||7/05/15 → 8/05/15|
Bibliographical notePublisher Copyright:
© 2015 IEEE.
- Bloom filter
- content centric network
- name prefix matching
- name prefix trie