TY - GEN
T1 - A Probability-based Caching Strategy with Consistent Hash in Named Data Networking
AU - Qin, Yang
AU - Yang, Weihong
AU - Liu, Wu
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2019/1/8
Y1 - 2019/1/8
N2 - 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.
AB - 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.
KW - caching strategy
KW - consistent hash
KW - named data networking
KW - probability-based
UR - https://www.scopus.com/pages/publications/85062033337
U2 - 10.1109/HOTICN.2018.8606014
DO - 10.1109/HOTICN.2018.8606014
M3 - 会议稿件
AN - SCOPUS:85062033337
T3 - Proceedings of 2018 1st IEEE International Conference on Hot Information-Centric Networking, HotICN 2018
SP - 67
EP - 72
BT - Proceedings of 2018 1st IEEE International Conference on Hot Information-Centric Networking, HotICN 2018
A2 - Kai, Lei
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 1st IEEE International Conference on Hot Information-Centric Networking, HotICN 2018
Y2 - 15 August 2018 through 17 August 2018
ER -