Title: A caching strategy based on dynamic popularity for named data networking

Authors: Meiju Yu; Ru Li

Addresses: College of Computer Science, Inner Mongolia University, No.235, College West Road, Hohhot City, Inner Mongolia, China ' College of Computer Science, Inner Mongolia University, No.235, College West Road, Hohhot City, Inner Mongolia, China

Abstract: Named data networking (NDN) is a prominent architecture for the future internet. In NDN, routers have the capacity of in-network cache, which can completely improve network performance. However, the cache capacity in routers is limited and how to utilise the cache resources effectively is still a great challenge. To solve the problem, this study presents a dynamic popularity caching strategy based on additive increase multiplicative decrease for NDN (DPCA). DPCA takes content popularity and caching capacity into account and it utilises AIMD algorithm to adjust the popularity threshold dynamically. At the same time, it also proposes a evict algorithm which takes the historical information of content popularity, the trend of content request and the interval from the last request time into account. The simulation results show that the DPCA strategy can effectively improve cache hit ratio, decrease network throughput and reduce the average hit distance compared with other schemes.

Keywords: named data networking; NDN; caching strategy; dynamic popularity; evict algorithm.

DOI: 10.1504/IJITM.2020.10028767

International Journal of Information Technology and Management, 2020 Vol.19 No.4, pp.305 - 317

Received: 18 Jul 2018
Accepted: 26 Mar 2019

Published online: 22 Apr 2020 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article