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

28 Citations (Scopus)

Abstract

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 publicationIEEE International Workshop on Quality of Service, IWQoS
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages198-207
Number of pages10
ISBN (Print)9781479948529
DOIs
StatePublished - Sep 30 2014
Event22nd IEEE International Symposium of Quality of Service, IWQoS 2014 - Hong Kong, Hong Kong
Duration: May 26 2014May 27 2014

Other

Other22nd IEEE International Symposium of Quality of Service, IWQoS 2014
CountryHong Kong
CityHong Kong
Period5/26/145/27/14

Fingerprint

Data structures
Wire
Data storage equipment

Keywords

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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Wang, Y., Xu, B., Tai, D., Lu, J., Zhang, T., Dai, H., ... Liu, B. (2014). Fast name lookup for named data networking. In IEEE International Workshop on Quality of Service, IWQoS (pp. 198-207). [6914320] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/IWQoS.2014.6914320

Fast name lookup for named data networking. / Wang, Yi; Xu, Boyang; Tai, Dongzhe; Lu, Jianyuan; Zhang, Ting; Dai, Huichen; Zhang, Beichuan; Liu, Bin.

IEEE International Workshop on Quality of Service, IWQoS. Institute of Electrical and Electronics Engineers Inc., 2014. p. 198-207 6914320.

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

Wang, Y, Xu, B, Tai, D, Lu, J, Zhang, T, Dai, H, Zhang, B & Liu, B 2014, Fast name lookup for named data networking. in IEEE International Workshop on Quality of Service, IWQoS., 6914320, Institute of Electrical and Electronics Engineers Inc., pp. 198-207, 22nd IEEE International Symposium of Quality of Service, IWQoS 2014, Hong Kong, Hong Kong, 5/26/14. https://doi.org/10.1109/IWQoS.2014.6914320
Wang Y, Xu B, Tai D, Lu J, Zhang T, Dai H et al. Fast name lookup for named data networking. In IEEE International Workshop on Quality of Service, IWQoS. Institute of Electrical and Electronics Engineers Inc. 2014. p. 198-207. 6914320 https://doi.org/10.1109/IWQoS.2014.6914320
Wang, Yi ; Xu, Boyang ; Tai, Dongzhe ; Lu, Jianyuan ; Zhang, Ting ; Dai, Huichen ; Zhang, Beichuan ; Liu, Bin. / Fast name lookup for named data networking. IEEE International Workshop on Quality of Service, IWQoS. Institute of Electrical and Electronics Engineers Inc., 2014. pp. 198-207
@inproceedings{b41739ddbf904dc4ad8de306c38c675e,
title = "Fast name lookup for named data networking",
abstract = "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.",
keywords = "Linear Search, Name Lookup, Named Data Networking, Perfect Hash Table, Random Search",
author = "Yi Wang and Boyang Xu and Dongzhe Tai and Jianyuan Lu and Ting Zhang and Huichen Dai and Beichuan Zhang and Bin Liu",
year = "2014",
month = "9",
day = "30",
doi = "10.1109/IWQoS.2014.6914320",
language = "English (US)",
isbn = "9781479948529",
pages = "198--207",
booktitle = "IEEE International Workshop on Quality of Service, IWQoS",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Fast name lookup for named data networking

AU - Wang, Yi

AU - Xu, Boyang

AU - Tai, Dongzhe

AU - Lu, Jianyuan

AU - Zhang, Ting

AU - Dai, Huichen

AU - Zhang, Beichuan

AU - Liu, Bin

PY - 2014/9/30

Y1 - 2014/9/30

N2 - 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.

AB - 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.

KW - Linear Search

KW - Name Lookup

KW - Named Data Networking

KW - Perfect Hash Table

KW - Random Search

UR - http://www.scopus.com/inward/record.url?scp=84907893016&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84907893016&partnerID=8YFLogxK

U2 - 10.1109/IWQoS.2014.6914320

DO - 10.1109/IWQoS.2014.6914320

M3 - Conference contribution

AN - SCOPUS:84907893016

SN - 9781479948529

SP - 198

EP - 207

BT - IEEE International Workshop on Quality of Service, IWQoS

PB - Institute of Electrical and Electronics Engineers Inc.

ER -