An efficient content placement scheme based on normalized node degree in content centric networking

doi:10.1007/s10586-020-03185-0

2020-09-22

PRE

Sumit Kumar

Rajeev Tiwari *

DOI：10.1007/s10586-020-03185-0

原文链接

原文求助

摘要

En 中文

Content-centric networking (CCN) becomes an imminent Internet architecture that emphasizes the data-centric approach for information retrieval instead of searching for the hosts in the network. CCN offers data (content) caching and its distribution capabilities to reduce average latency, the load of data servers, and improve network bandwidth utilization during content delivery. In this direction, the performance of node degree centrality and distance-based autonomous caching strategies have been investigated. Then, a novel content caching strategy called content placement based on normalized node degree and distance (CPNDD) is proposed. The CPNDD scheme considers content provider distance and node degree centrality parameters together to select the optimal cache locations for comprehensive utilization of the available caching capacities and a further reduction in average latency during content retrieval. The weights for these caching parameters have been determined via widespread simulations on the Abilene networks. The proposed caching scheme is implemented and tested in the simulated environment of ndnSIM and compared with peer competing schemes in CCN. The execution outcomes are examined for different caching capacities (50 and 100), Zipf popularity skewness factors (0.7 and 1.0) and request rates (50/s and 100/s). The simulation executions illustrate that CPNDD caching strategy escalates the cache hit probability and hop-reduction ratio up-to 8% and 9% as compared to existing schemes. Hence, the proposed content placement scheme improves the performance of CCN networks considerably and makes it suitable for the applications of Industry 4.0.

Keyword:

CCN

Hit ratio

Network performance

Node degree