A Cache Probability Replacement Policy Based on Content Popularity in Content Centric Networks
Zhu Yi①② Mi Zheng-kun①③ Wang Wen-nai①
①(College of Communications & Information Engineering, Nanjing University of Posts and Telecommunications, Nanjing 210046, China) ②(School of Computer Science and Telecommunication Engineering, Jiangsu University, Zhenjiang 212013, China) ③(Key Laboratory of Broadband Wireless Communication and Sensor Network Technology (Nanjing University of Posts and Telecommunications), Ministry of Education, Nanjing 210046, China)
Abstract：As the next Internet research hotspot, Content Centric Networks (CCN) provide content dissemination through distributed content cache machines and change the traditional host-centric network architecture. Cache replacement policy is one of the core issues in CCN which will directly restrict the data dissemination performance of the network. Considering the content popularity distribution characteristic, this paper proposes a cache probability replacement policy based on content popularity and derives the closed-form expressions which calculate the average request miss probability of different levels in a L-level tandem network scenario. This policy is designed to select a data chunk replacement position in cache according to its popularity and try to balance the proportion of different popularity contents stored in the network nodes. Numerical results show that this policy is suitable for the network application with higher requests’ aggregation. In this scenario, it can obviously promote the dissemination performance of low contents compared with the traditional Least Recently Used (LRU) policy.
朱轶, 糜正琨, 王文鼐. 一种基于内容流行度的内容中心网络缓存概率置换策略[J]. 电子与信息学报, 2013, 35(6): 1305-1310.
Zhu Yi, Mi Zheng-Kun, Wang Wen-Nai. A Cache Probability Replacement Policy Based on Content Popularity in Content Centric Networks. , 2013, 35(6): 1305-1310.
2013, Vol. 35 
