Scalable Multi-Hash Name Lookup Method for Named Data Networking

A Scalable Multi-Hash (SMH) name lookup method is proposed, which is based on hierarchical name decomposition to aggregate names sharing common prefixes and multiple scalable hash tables to minimize collisions among prefixes. We take the component instead of the entire name as a key in the hash functions. The SMH method achieves lookup speeds of 21.45 and 20.87 Mbps on prefix table with 2 million and 3.6 million names, respectively. The proposed method is the fastest of the four methods considered and requires 61.63 and 89.17 Mb of memory on the prefix tables with 2 million and 3.6 million names, respectively. The required memory is slightly larger than the best method. The scalability of SMH outperforms that of the other two methods.