A Fast Name Lookup Method in NDN Based on Hash Coding

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.