A Novel Cache Replacement Scheme against Cache Pollution Attack in Content-Centric Networks

In-network cache is a key service of content-centric networks. As an instance of content-centric networks, Named Data Networking (NDN) uses the traditional Least Recently Used (LRU) and Least Frequently Used (LFU) cache replacement strategy, which will cause large storage redundancy. Besides, as the content cache pollution attack may degrade the performance of the cache mechanisms and increase the content retrieval latency, a robust cache mechanism is especially required. To solve these problems, in this paper we propose a new intra-network cache replacement strategy, which integrates evaluating the popularity of caching contents and the betweenness of the nodes in the network topology. This strategy realizes the best performance of cache replacement in the network by weighing the importance of each node and the cache content popularity within the domain. Finally, the simulation results show that the new cache replacement strategy proposed in this paper can achieve a higher cache hit rate and less average hops than the LRU and the LFU cache replacement strategy in the NDN network.