Abstract
Named data networking (NDN) is a content-centric network for the future of the internet. An NDN a packet is delivered based on a content name instead of a destination IP address. The name lookup for packet forwarding is challenging because the content name is variable, and its space is unbounded. This paper proposes a novel name lookup scheme that employs a hashing technique combined with Patricia tries. In this scheme, hash tables are dynamically maintained according to the hierarchical structure of the name, so the name can effectively accommodate variable and unbounded content names. Unlike chaining, a Patricia trie compares a key string only once at a leaf node, so it provides a fast name lookup. The proposed lookup scheme is implemented and evaluated by using an Intel Core i7-2600 CPU and 4GB of memory. Experimental results show that our scheme gives good scalability and a high throughput of name lookup with a controlled memory consumption.
Highlights
Named data networking (NDN) is a promising structure for future internet architecture [1,2,3].The packet delivery in NDN is not based on the destination address but the content name
Name lookup schemes are usually based on ternary content-addressable memory (TCAM), hashing, or trie structures
Each hash table entry has the pointer to a Patricia trie, which is provided for overflow area
Summary
Named data networking (NDN) is a promising structure for future internet architecture [1,2,3]. Each NDN router forwards an incoming packet based on the name in the packet It should look up a forwarding information base (FIB) to find the matching name prefix with a given content name. Name lookup schemes are usually based on ternary content-addressable memory (TCAM), hashing, or trie structures. A trie-based name lookup may endure many memory accesses due to unbounded name space. Most hash-based name lookup schemes are based on flat-style full name prefixes, even though the name itself is hierarchically constructed with components. A component-based hierarchical hashing scheme can know the length in advance before hashing. The proposed scheme deals with the hash collision by using a Patricia trie instead chaining,which whichreduces reducesthe thesearch searchtime timesignificantly.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
