A New Cache Replacement Policy in Named Data Network Based on FIB Table Information

Abstract

Abstract Named Data Network (NDN) is proposed for the Internet as an information-centric architecture. Content storing in the router’s cache plays a significant role in NDN. When a router’s cache becomes full, a cache replacement policy determines which content should be discarded for the new content storage. This paper proposes a new cache replacement policy called Discard of Fast Retrievable Content (DFRC). In DFRC, the retrieval time of the content is evaluated using the FIB table information, and the content with less retrieval time receives more discard priority. An impact weight is also used to involve both the grade of retrieval and stale parameters in the discard priority calculation. This weight adjusts the relative impact of these two parameters on the discard priority. The grade of retrieval reflects the content’s retrieval time, and the stale parameter indicates its popularity. The reinforcement Learning (RL) method is used to calculate the suitable weight dynamically and based on the network condition. Simulation results show that DFRC improves hit rate and round-trip time compared to Least Recently Used (LRU), Optimized Cache Replacement algorithm for Information-Centric Networks (OCRICN), Efficient Popularity-aware Probabilistic Caching (EPPC), and Shortest Round-Trip Time (SRTT).