Collaborative Caching and Routing Scheme Based on Local Request Similarity in Named Data Networking

How to efficiently cache and take advantage of largely distributed copies poses challenges to the retrieval process of Named Data Networking (NDN). On the basis of similarity in local request, a collaborative caching and routing scheme is proposed. In the scheme, redundancy elimination in vertical requesting path and collaborative cache in horizontal local scope are effectively combined on the caching decision-making. In the vertical direction, the similar community which has the highest active value along the content delivery path is calculated based on the path caching strategy. In the horizontal direction, consistent Hash-caching is implemented to fulfill the oriented cache for the requested data in the vicinity. When a retrieve is requested, the proposed scheme dynamically performs the local lookup according to the content popularity by introduction of the local cache factor into the routing process. The simulation results show that the scheme can decrease the request latency, reduce the cache redundancy,