A popularity-based cooperative caching in content-centric networking

Currently, the mobile data traffic is tremendously increasing and the solution is needed to handle this increasing demands. There are several solutions to solve this issue. Among them, the Content-Centric Networking (CCN) is one of the most promising solutions, where CCN reduces the network traffic by caching the contents in-network nodes temporarily. So, the in-network nodes can provide these cached contents to the user, instead of retrieving from the original server. Hence the caching scheme is important for the efficient use of cache and content delivery. Even tough, there are several caching decision algorithms already existed, it is still a great challenge to better utilize in-network caching of CCN. In this paper, we propose an effective popularity-based caching scheme in response to the special characteristics of CCN with the idea to reduce content redundancy within network and make popular contents near the network edge. We evaluate our approach using k-ary tree network topology with many factors that may have impacts on the performance. Results show that our approach can significantly reduce content redundancy, and outperforms existing schemes in access hops and server hit proportion.