Research Article
The Cache Location Selection Based on Group Betweenness Centrality Maximization
@INPROCEEDINGS{10.1007/978-3-319-60717-7_27, author={Jianfeng Guan and Zhiwei Yan and Su Yao and Changqiao Xu and Hongke Zhang}, title={The Cache Location Selection Based on Group Betweenness Centrality Maximization}, proceedings={Quality, Reliability, Security and Robustness in Heterogeneous Networks. 12th International Conference, QShine 2016, Seoul, Korea, July 7--8, 2016, Proceedings}, proceedings_a={QSHINE}, year={2017}, month={8}, keywords={CCN Cache Group betweenness centrality}, doi={10.1007/978-3-319-60717-7_27} }- Jianfeng Guan
Zhiwei Yan
Su Yao
Changqiao Xu
Hongke Zhang
Year: 2017
The Cache Location Selection Based on Group Betweenness Centrality Maximization
QSHINE
Springer
DOI: 10.1007/978-3-319-60717-7_27
Abstract
Content-Centric Networking (CCN) as a content-oriented network architecture can provide efficient content delivery via its in-network caching. However, it is not optimal way to cache contents at all intermediate routers for that the current technology is not yet ready to support an Internet scale deployment. Therefore, in this paper we study the cache location selection problem with an objective to maximize cache delivery performance while minimize the cache nodes. The existing work select cache location based on the important of single node rather than that of entire group, which may result in inefficient problem caused by reduplicative impertinences. Therefore in this paper, we adopt group centrality especially Group Betweenness Centrality (GBC) to select cache locations. To evaluate its performance, we simulate CCN caching under different topologies, and the final results show that GBC-based scheme can provide better performance than others in term of average hop of content delivery.