Dynamic Popularity-Based Caching Permission Strategy for Named Data Networking
Meiju Yu, Ru Li · 2018
Named Data Networking (NDN) is one of the future Internet architectures and has recently attracted a great deal of attention. NDN adopts named routing and caches all contents passing by. So it helps to reduce network traffic, accelerate content distribution and reduces content retrieval latency. However, the default caching strategy named Leave Copies Everywhere (LCE) also brings a large number of redundant data and the higher number of content replacements in NDN. In this paper, we present a Dynamic Popularity-Based Caching Permission strategy (DPCP). DPCP takes advantage of interest packet and data packet to carry content popularity, so routers in the path can obtain the information about the content popularity and uses dynamic popularity threshold to make cache permission policy. It also introduces cache control flag to avoid caching the same redundant copies in adjacent routers. The simulation results show that the DPCP strategy can effectively reduce the amount of redundant data in the network as well as reduce the number of the content replacement while acquiring the similar cache hit ratio compared to LCE.