A Probability-based Caching Strategy with Consistent Hash in Named Data Networking

Abstract

In-network caching is one of prominent features of Named Data Networking (NDN), which greatly improves the performance of data transmission. In this paper, we propose a probability-based caching strategy with consistent hash (Prob-CH). Prob-CH makes caching decision based on the probability that calculated by jointly considering content’s popularity, node’s betweenness, and distance to consumers. The consistent hashing algorithm is used to guarantee that there is at most one copy cached in the network, which can reduce the redundancy of cache. Moreover, Prob-CH forwards a newly arriving Interest according to a dual forwarding strategy, in which an Interest packet will be guided to producer and its cached node calculated by consistent hashing, respectively. The simulation results show that the proposed Prob-CH caching strategy can achieve better performance in terms of cache-hit ratio, hop counts and server load.