Greedy name lookup for named data networking

Authors:
Yi Wang;Dongzhe Tai;Ting Zhang;Jianyuan Lu;Boyang Xu;Huichen Dai;Bin Liu
Affiliations:
Tsinghua University, Beijing, China;Tsinghua University, Beijing, China;Tinghua University, Beijing, China;Tsinghua University, Beijing, China;Tsinghua University, Beijing, China;Tsinghua University, Beijing, China;Tsinghua University, Beijing, China
Venue:
Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems
Year:
2013

Citing 3
Cited 0

Networking named content

Proceedings of the 5th international conference on Emerging networking experiments and technologies
Scalable Name Lookup in NDN Using Effective Name Component Encoding

ICDCS '12 Proceedings of the 2012 IEEE 32nd International Conference on Distributed Computing Systems
Wire speed name lookup: a GPU-based approach

nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Different from the IP-based routers, Named Data Networking routers forward packets by content names, which consist of characters and have variable and unbounded length. This kind of complex name constitution plus the huge-sized name routing table makes wire speed name lookup an extremely challenging task. Greedy name lookup mechanism is proposed to speed up name lookup by dynamically adjusting the search path against the changes of the prefix table. Meanwhile, we elaborate a string-oriented perfect hash table to reduce memory consumption which stores the signature of the key in the entry instead of the key itself. Extensive experimental results on a commodity PC server with 3 million name prefix entries demonstrate that greedy name lookup mechanism achieves 57.14 million searches per second using only 72.95 MB memory.