Local Tree Hunting Scheme to Find the Closest Content in In-Network Cache

摘要

CCN/ICN with in-network cache capability has been expected as Future Internet. This paper proposes a novel content discovery scheme called Local Tree Hunting for cached contents. It provides almost the same hunting performance as the entire hunting although the hunting area is localized into a tree whose root is the node with caching history. As an option, when caching the state is notified to neighbor nodes to make a short-cut of request forwarding. The effectiveness of the proposed scheme is verified with computer simulation with a Zipf s law content popularity distribution and the Least Recently Used eviction model.