Least Recently Frequently Used Replacement Policy in Named Data Network

Abstract

Internet users growth in last few years rapidly increased, which affected the number of content variation that requested by users. Network performance takes an important aspect to provided the best performance while sending the content requested by users. Named Data Network (NDN) is a new improvement in Information-Centric Network (ICN). NDN gives a new paradigm into networking by enabling cache system in NDN router and using the name as a network address, instead of using an IP address. Router caching effectively improved the network performance due to the user instantly request the content into the nearest router that connected in same NDN network, instead of request the content directly to the producer. Caching policy in NDN router controlled by a replacement policy. In this paper, we implement LRFU algorithm as a new replacement policy in ndnSIM, then we compare LRFU replacement policy with LRU and Priority-FIFO replacement policy based on content store size, interest rate, and the size of grid topology variation. From the simulation result, we found that the LRFU replacement policy achieved 3.36% higher hit rate than LRU and 5.78% higher compared with Priority-FIFO replacement policy.