As one of promising future Internet architectures, named data networking (NDN) technology has been widely researched in these days. As a basic name lookup structure used in NDN routers, a name prefix trie (NPT) is an extended version of a binary trie used for IP address lookup. However, since name prefixes can have an unbounded number of components, an NPT can have many empty nodes which cause memory wastes as well as low lookup performance. In this paper, we propose a pathcompressed NPT (PC-NPT) to reduce the memory requirement and improve the search performance. Simulations using real URL data sets show that the proposed structure removes up to 97% of empty nodes and improves approximately 21% in the search performance.
|Title of host publication||2016 IEEE International Conference on Consumer Electronics-Asia, ICCE-Asia 2016|
|Publisher||Institute of Electrical and Electronics Engineers Inc.|
|State||Published - 3 Jan 2017|
|Event||2016 IEEE International Conference on Consumer Electronics-Asia, ICCE-Asia 2016 - Seoul, Korea, Republic of|
Duration: 26 Oct 2016 → 28 Oct 2016
|Name||2016 IEEE International Conference on Consumer Electronics-Asia, ICCE-Asia 2016|
|Conference||2016 IEEE International Conference on Consumer Electronics-Asia, ICCE-Asia 2016|
|Country/Territory||Korea, Republic of|
|Period||26/10/16 → 28/10/16|
Bibliographical noteFunding Information:
This research was supported by the National Research Foundation of Korea (NRF), NRF-2014R1A2A1A11051762 and NRF-2015R1A2A1A15054081. This research was also supported by the Ministry of Science, ICT and Future Planning (MSIP), Korea, under the Information Technology Research Center (ITRC) support program (IITP-2016-H8501-15-1007) supervised by the Institute for Information & communications Technology Promotion (IITP).
© 2016 IEEE.