Popularity-driven coordinated caching in named data networking

The built-in caching capability of future Named Data Networking (NDN) will enable effective content distribution at a global scale without special infrastructure. The aim of this work is to design efficient caching schemes in NDN to achieve better network layer performance and application layer performance. With the specific objective of minimizing both inter-ISP (Internet Service Provider) traffic and average access latency, we first formulate the optimization problems for different objectives and solve the problems to obtain the optimal replica placement. Then we develop popularity-driven caching schemes which dynamically place the replicas in the caches on the en-route path in a coordination fashion. Simulation results show that our caching algorithms are very closer to the optimum and outperform the widely used algorithms in terms of minimizing inter-ISP traffic and the average access hops. Finally, we thoroughly evaluate the impact of several important design issues such as network topology, cache size, access pattern and content popularity on the caching performance and demonstrate that the proposed schemes are effective, stable, scalable and with a low overhead