Content hunting for in-network cache: Design and performance analysis

Abstract

In-network caching is a core technology for saving network resources and improving the response time in Information-/Content-Centric Networking (ICN/CCN). In an ordinary ICN/CCN, content name based routing is used to find cached content in the network. Although there have been several studies on effective and efficient cache retrieval from in-network caches, we propose a novel content hunting scheme, named Local Tree Hunting (LTH) from the point of view to approach the ideal performance. LTH hunts for the closest node to the request node among the nodes with disseminated cache content. It autonomously adjusts the hunting area by changing the size of the hunting tree depending on the degree to which the content has been disseminated through the network. The proposed scheme was verified in a performance analysis; it was shown to have almost the same level of performance as the case of finding the true closest node. System architecture and operations based on the proposed scheme are also described.