Efficient Congestion and Popularity-Aware Caching Solution for Named Data Networking

Named Data Networking (NDN) is a future Internet architecture that aims at the efficient utilization of network resources and improved data availability by enabling in-network caching. The efficiency of NDN depends, among others, on the performance of caching strategies, which depends on many parameters such as the caching decision policy, the replacement policy, and the forwarding algorithm. In this paper, we introduce a novel caching strategy, dubbed CPAC, that is both congestion- and popularity-aware. The aim is to store popular contents that are generally downloaded through congested and expensive links. This trade-off between the state of the link through which the content has been routed and the popularity of the content avoids caching unpopular contents that arrive from non-congested links. The efficiency of CPAC is demonstrated through comparative simulations on dedicated NDN platforms.