Adaptive forwarding in named data networking
ACM SIGCOMM Computer Communication Review
Toward fast NDN software forwarding lookup engine based on hash tables
Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems
On pending interest table in named data networking
Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems
A case for stateful forwarding plane
Computer Communications
Greedy name lookup for named data networking
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Wire speed name lookup: a GPU-based approach
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
Named data networking on a router: fast and dos-resistant forwarding with hash tables
ANCS '13 Proceedings of the ninth ACM/IEEE symposium on Architectures for networking and communications systems
GPU-accelerated name lookup with component encoding
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
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.