Vol.65, No.1, 2020, pp.321-336, doi:10.32604/cmc.2020.010831
A Cache Replacement Policy Based on Multi-Factors for Named Data Networking
  • Meiju Yu1, Ru Li1, *, Yuwen Chen2
1 College of Computer Science, Inner Mongolia University, Hohhot, 020021, China.
2 Department of Computer Systems Technology, New York City College of Technology-The City University of New York, Brooklyn, NY 11201, USA.
* Corresponding Author: Ru Li. Email: csliru@imu.edu.cn.
Received 31 March 2020; Accepted 08 May 2020; Issue published 23 July 2020
Named Data Networking (NDN) is one of the most excellent future Internet architectures and every router in NDN has the capacity of caching contents passing by. It greatly reduces network traffic and improves the speed of content distribution and retrieval. In order to make full use of the limited caching space in routers, it is an urgent challenge to make an efficient cache replacement policy. However, the existing cache replacement policies only consider very few factors that affect the cache performance. In this paper, we present a cache replacement policy based on multi-factors for NDN (CRPM), in which the content with the least cache value is evicted from the caching space. CRPM fully analyzes multi-factors that affect the caching performance, puts forward the corresponding calculation methods, and utilize the multi-factors to measure the cache value of contents. Furthermore, a new cache value function is constructed, which makes the content with high value be stored in the router as long as possible, so as to ensure the efficient use of cache resources. The simulation results show that CPRM can effectively improve cache hit ratio, enhance cache resource utilization, reduce energy consumption and decrease hit distance of content acquisition.
Cache replacement policy, named data networking, content popularity, freshness, energy consumption.
Cite This Article
Yu, M., Li, R., Chen, Y. (2020). A Cache Replacement Policy Based on Multi-Factors for Named Data Networking. CMC-Computers, Materials & Continua, 65(1), 321–336.
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.