A new name prefix trie with path compression

Jungwon Lee, Hyesook Lim

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

9 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publication2016 IEEE International Conference on Consumer Electronics-Asia, ICCE-Asia 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9781509027439
DOIs
StatePublished - 3 Jan 2017
Event2016 IEEE International Conference on Consumer Electronics-Asia, ICCE-Asia 2016 - Seoul, Korea, Republic of
Duration: 26 Oct 201628 Oct 2016

Publication series

Name2016 IEEE International Conference on Consumer Electronics-Asia, ICCE-Asia 2016

Conference

Conference2016 IEEE International Conference on Consumer Electronics-Asia, ICCE-Asia 2016
Country/TerritoryKorea, Republic of
CitySeoul
Period26/10/1628/10/16

Fingerprint

Dive into the research topics of 'A new name prefix trie with path compression'. Together they form a unique fingerprint.

Cite this