A new name prefix trie with path compression
- 등재 SCOPUS
- 발행기관 Institute of Electrical and Electronics Engineers Inc.
- 발행년도 2016
- 총서유형 Journal
- 회의명 2016 IEEE International Conference on Consumer Electronics-Asia, ICCE-Asia 2016
- 일자 26 October 2016 through 28 October 2016
- URI http://www.dcollection.net/handler/ewha/000000141678
- ISBN 9781509027439
- 본문언어 영어
- Published As http://dx.doi.org/10.1109/ICCE-Asia.2016.7804781
초록/요약
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. © 2016 IEEE.
more