Caching algorithm with a novel cost model to deliver content and its interest over content centric networks

摘要

Recently the content centric networks (CCNs) have been advocated as a new solution to design future networks. In the CCNs, content and its interest are delivered over the content store and pending interest table, respectively, where both have limited capacities. Therefore, how to design the corresponding algorithms to efficiently deliver content and inertest over them becomes an important issue. In this paper, based on the analysis of content distribution, status of content store, and pending interest, we propose a novel caching algorithm with which the resources of content store and pending interest table can be efficiently used. Simulation results prove that the proposal can outperform the conventional methods.