A hierarchical-based sequential caching scheme in named data networking

Named data networking (NDNs) is an idealized deployment of information-centric networking (ICN) that has attracted attention from scientists and scholars worldwide. A distributed in-network caching scheme can efficiently realize load balancing. However, such a ubiquitous caching approach may cause problems including duplicate caching and low data diversity, thus reducing the caching efficiency of NDN routers. To mitigate these caching problems and improve the NDN caching efficiency, in this paper, a hierarchical-based sequential caching (HSC) scheme is proposed. In this scheme, the NDN routers in the data transmission path are divided into various levels and data with different request frequencies are cached in distinct router levels. The aim is to cache data with high request frequencies in the router that is closest to the content requester to increase the response probability of the nearby data, improve the data caching efficiency of named data networks, shorten the response time, and reduce cache redundancy. Simulation results show that this scheme can effectively improve the cache hit rate (CHR) and reduce the average request delay (ARD) and average route hop (ARH).