Scalable Name Lookup in NDN Using Effective Name Component Encoding

Citations Over TimeTop 1% of 2012 papers

Abstract

Name-based route lookup is a key function for Named Data Networking (NDN). The NDN names are hierarchical and have variable and unbounded lengths, which are much longer than IPv4/6 address, making fast name lookup a challenging issue. In this paper, we propose an effective Name Component Encoding (NCE) solution with the following two techniques: (1) A code allocation mechanism is developed to achieve memory-efficient encoding for name components, (2) We apply an improved State Transition Arrays to accelerate the longest name prefix matching and design a fast and incremental update mechanism which satisfies the special requirements of NDN forwarding process, namely to insert, modify, and delete name prefixes frequently. Furthermore, we analyze the memory consumption and time complexity of NCE. Experimental results on a name set containing 3,000,000 names demonstrate that compared with the character trie NCE reduces overall 30% memory. Besides, NCE performs a few millions lookups per second (on an Intel 2.8 GHz CPU), a speedup of over 7 times compared with the character trie. Our evaluation results also show that NCE can scale up to accommodate the potential future growth of the name sets.

Related Papers

• → Visual Search Optimization(2015)1 cited
• → The Effect of Communication and Synchronization on Amdahl Law in Multicore Systems(2013)6 cited
• → A Hybrid Parallelization of AIM for Multi-Core Clusters: Implementation Details and Benchmark Results on Ranger(2010)5 cited
• → Improving Locality in the Parallelization of Doacross Loops(2002)1 cited
• → A study of average-case speedup and scalability of parallel computations on static networks(1999)