An Improved Trie-based Name Lookup Scheme for Named Data Networking

In Named Data Networking (NDN), the speed of name lookup operation and the scalability concern impact deeply on the performance of the forwarding system. NDN names can contain unbounded number of components which may result in intolerable lookup time. And since routers cannot have unlimited table size to keep up with the unbounded nature of application data namespace of NDN, it may lead to missing records for valid data names in the routing table. In this paper, we propose a port information assisted trie or P-trie to help solve these two issues: name lookup process is accelerated with the help of the port information on nodes of the trie, and packets with names not in the routing tables are forwarded to a most promising port based on the analysis of existing entries. We implemented P-trie in a multi-aligned transition array (MATA) to reduce the memory footprint. Experiments show that the name lookup rate of our P-trie can be times faster than other trie based methods.CPCI-S(ISTP)dgli@pkusz.edu.cn1294-129