A Simulation of Cache Replacement Strategy on Named Data Network

Abstract

NDN (Named Data Networking) as one approach of the Content-Centric Networking (CCN) architecture, proposed by Jacobson, 2006, conceptually, has some advantages compares to the current Internet technology which build based on host-to-host TCP/IP protocol stack. However, technically, we have to examine the NDN approach, beside to prove the concept, also to get as much as able the opportunities of improvement the concept before implementation stage. In this work, it has been compared two kinds of cache replacement policy. The policies that compared are the Least Recency Used (LRU) and Least Recency/Frequency Used (LRFU). In the first stage both of these policies implemented and then the performance comparison has been investigated. Based on the experiment, the LRFU policy outperform LRU policy with a limited cache size. As a consequence the LRFU has a time complexity higher than LRU. Finally, based on the simulation can be concluded that LRFU should be considered as cache replacement strategy on NDN instead of basic NDN cache policy, named as caching everything everywhere (CEE)