An efficient adaptive cache management scheme for named data networks

Abstract

With the advent of modern technologies and applications, NDN networks have been known as a reliable approach to meeting the needs ahead. A prominent feature of these networks is the ability to cache comprehensive content within network nodes. Separating the content from the original location reduces the content retrieval latency, network traffic, and overhead within the applications containing considerable required data volume. This approach also improves the user experience. In this article, first, the idea of intra-network caching with an approach based on the cooperation of adjacent nodes along the path is proposed to form a local virtual cluster with distributed cache space. Second, popular cached data will be shared by exchanging minimal notification messages between them to develop content storage decisions. Two new modules are defined in each node, called RIT and NCT which have offered the possibility of utilizing the resources of nodes adjacent to the delivered route. In the next stage, a novel approach is proposed to determine the content caching threshold in each node by considering the parameters affecting the content, as well as the network topology and real-time status of the nodes. Finally, the decision mechanism regarding the storage of content in each node along the path is presented by using an adaptive approach based on set thresholds. In such a manner, undesirable redundancy of content that wastes network resources will be removed, and more caching space in each area of the network will be provided. The results of simulations using ndnSim revealed that the performance of the proposed algorithm (cache hit ratio, average data delivery latency and path stretch) is better than other existing benchmark strategies. Considering other different parameters confirmed the effectiveness of the presented approach.