A Fast Name Lookup Method in NDN Based on Hash Coding

DOI

10.2991/icmii-15.2015.98How to use a DOI?

Keywords

Named Data Network; Hash Coding, Longest Name Prefix Matching; Name Component Coding;

Abstract

Named Data Network (hereinafter called NDN), as one new content-centered network architecture, which routes and forwards the data in accordance with their names. And it satisfies the users’ demands for efficient access to mass and heterogeneous information in the network. However, for the data name, their structures are usually hierarchical and lengths variable, then the quick name-searching match becomes a very big challenge. In this essay, Hash Coding Name-searching System is introduced and proposed. In particular, the data name is compressed through the hash function, the quick name-searching is realized through the transition array, finally, the incremental update mechanism is designed to meet the frequent modification, insertion and delete of NDN name. Through experimental analysis we can know that the method will make the name compression ratio reach to 50% at least and the query efficiency increase 10% almost.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Shuaibo Feng
AU  - Mingchuan Zhang
AU  - Ruijuan Zheng
AU  - Qingtao Wu
PY  - 2015/10
DA  - 2015/10
TI  - A Fast Name Lookup Method in NDN Based on Hash Coding
BT  - Proceedings of the 3rd International Conference on Mechatronics and Industrial Informatics
PB  - Atlantis Press
SP  - 575
EP  - 580
SN  - 2352-538X
UR  - https://doi.org/10.2991/icmii-15.2015.98
DO  - 10.2991/icmii-15.2015.98
ID  - Feng2015/10
ER  -