Local Tree Hunting: Finding Closest Contents from In-Network Cache

Hiroshi SHIMIZU  Hitoshi ASAEDA  Masahiro JIBIKI  Nozomu NISHINAGA  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E98-D   No.3   pp.557-564
Publication Date: 2015/03/01
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2014NTP0010
Type of Manuscript: Special Section PAPER (Special Section on the Architectures, Protocols, and Applications for the Future Internet)
Category: Internet Architecture and Protocols
Keyword: 
ICN/CCN,  in-network caching,  name-based routing,  content dissemination,  local tree hunting,  branch-cast,  

Full Text: PDF(2.2MB)>>
Buy this Article




Summary: 
How to retrieve the closest content from an in-network cache is one of the most important issues in Information-Centric Networking (ICN). This paper proposes a novel content discovery scheme called Local Tree Hunting (LTH). By adding branch-cast functionality to a local tree for content requests to a Content-Centric Network (CCN) response node, the discovery area for caching nodes expands. Since the location of such a branch-casting node moves closer to the request node when the content is more widely cached, the discovery range, i.e. the branch size of the local tree, becomes smaller. Thus, the discovery area is autonomously adjusted depending on the content dissemination. With this feature, LTH is able to find the “almost true closest” caching node without checking all the caching nodes in the in-network cache. The performance analysis employed in Zipf's law content distribution model and which uses the Least Recently Used eviction rule shows the superiority of LTH with respect to identifying the almost exact closest cache.