Efficient lookup for NLAPB in named data networking

Abstract

In Named Data Networking, packet forwarding decisions depends on lookup operations on variable length names instead of fixed length IP addresses. Named data networking is another approach to the construction of computer networks. Its main principle is to provide communication network that should allow a user to concentrate on the data that user needs. In this paper, a new Efficient Name Lookup for NLAPB Adaptive is implemented. It mainly includes two stages based on the separation of B-prefix and T-suffix, which are totally different from the Name Filter. In the first stage, B-prefix of a name is first processed by Counting Bloom Filter (CBFs), and hash table assists to determine the location of corresponding T-suffix tree. If the name/prefix is short enough, the outgoing faces will be returned directly. In the second stage, with the knowledge of the root information the prefix matching continues based on the trie structure until a longest matching prefix is searched. Then corresponding forwarding phases will be returned.