Cui Xian-Dong, Liu Jiang, Huang Tao, Chen Jian-Ya, Liu Yun-Jie. A Novel In-network Caching Scheme Based on Betweenness and Replacement Rate in Content Centric Networking[J]. Journal of Electronics & Information Technology, 2014, 36(1): 1-7. doi: 10.3724/SP.J.1146.2013.00503
Citation:
Cui Xian-Dong, Liu Jiang, Huang Tao, Chen Jian-Ya, Liu Yun-Jie. A Novel In-network Caching Scheme Based on Betweenness and Replacement Rate in Content Centric Networking[J]. Journal of Electronics & Information Technology, 2014, 36(1): 1-7. doi: 10.3724/SP.J.1146.2013.00503
Cui Xian-Dong, Liu Jiang, Huang Tao, Chen Jian-Ya, Liu Yun-Jie. A Novel In-network Caching Scheme Based on Betweenness and Replacement Rate in Content Centric Networking[J]. Journal of Electronics & Information Technology, 2014, 36(1): 1-7. doi: 10.3724/SP.J.1146.2013.00503
Citation:
Cui Xian-Dong, Liu Jiang, Huang Tao, Chen Jian-Ya, Liu Yun-Jie. A Novel In-network Caching Scheme Based on Betweenness and Replacement Rate in Content Centric Networking[J]. Journal of Electronics & Information Technology, 2014, 36(1): 1-7. doi: 10.3724/SP.J.1146.2013.00503
In-network caching is one of the key aspects of Content Centric Networking (CCN), which is widely concerned recently. However, the ALWAYS caching scheme (caching everywhere on the delivery path) in CCN produces a great of redundancy, while the Betw scheme leads to that the node has the more frequent replacement with the larger betweenness centrality, which will decrease the availability of the content. In this paper, a novel in-network caching scheme named BetwRep is proposed based on a metric including the betweenness centrality and the replacement rate of one node to address the problem-where to cache along the delivery path. Simulation experiment based on ndnSIM demonstrates that the BetwRep caching scheme achieves the lower loading in the source server and less average hops than that of Betw scheme and ALWAYS scheme.