Fast name lookup for named data networking

Yi Wang, Boyang Xu, Dongzhe Tai, Jianyuan Lu, Ting Zhang, Huichen Dai, Beichuan Zhang, Bin Liu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

41 Scopus citations


Complex name constitution plus huge-sized name routing table makes wire speed name lookup a challenging task in Named Data Networking. To overcome this challenge, we propose two techniques to significantly speed up the lookup process. First, we look up name prefixes in an order based on the distribution of prefix length in the forwarding table, which can find the longest match much faster than the linear search of current prototype CCNx. The search order can be dynamically adjusted as the forwarding table changes. Second, we propose a new near-perfect hash table data structure that combines many small sparse perfect hash tables into a larger dense one while keeping the worst-case access time of O(1) and supporting fast update. Also the hash table stores the signature of a key instead of the key itself, which further improves lookup speed and reduces memory use.

Original languageEnglish (US)
Title of host publication2014 IEEE 22nd International Symposium of Quality of Service, IWQoS
PublisherInstitute of Electrical and Electronics Engineers Inc.
Number of pages10
ISBN (Electronic)9781479948529
StatePublished - Sep 30 2014
Event22nd IEEE International Symposium of Quality of Service, IWQoS 2014 - Hong Kong, Hong Kong
Duration: May 26 2014May 27 2014

Publication series

NameIEEE International Workshop on Quality of Service, IWQoS
ISSN (Print)1548-615X


Other22nd IEEE International Symposium of Quality of Service, IWQoS 2014
Country/TerritoryHong Kong
CityHong Kong


  • Linear Search
  • Name Lookup
  • Named Data Networking
  • Perfect Hash Table
  • Random Search

ASJC Scopus subject areas

  • Electrical and Electronic Engineering


Dive into the research topics of 'Fast name lookup for named data networking'. Together they form a unique fingerprint.

Cite this