%0 Journal Article
%A FENG Chun-yan
%A ZHANG Tian-kui
%A ZHU Guang-yu
%A SHAN Si-yang
%T A Joint Cache Placement and Replacement Algorithm for Cache Requirements of New Contents in CCN
%D 2021
%R 10.13190/j.jbupt.2020-086
%J Journal of Beijing University of Posts and Telecommunications
%P 68-74
%V 44
%N 2
%X In content centric networking (CCN), in order to solve the problem that the existing global cache placement algorithm cannot optimize the cache placement for new content in real time, the global cache placement and replacement algorithm for new content cache requirements is studied, reducing the cache node load and content acquisition delay for users. The network-wide cache gain function is defined, and the optimization problem of maximizing the entire network cache gain is formulated to realize the cache placement of new contents and the cache replacement of existing contents. The optimization problem is decomposed into a cache placement sub-problem and a cache replacement sub-problem. A suboptimal solution to the global cache placement optimization problem is proposed. A collaborative cache replacement algorithm to minimize the loss of cache gain due to cache replacement is proposed. Finally, the joint optimization of cache placement and replacement is realized through iterations. Simulation shows that the proposed algorithm is superior to the traditional methods in terms of cache node load, user hop count and cache hit ratio.
%U https://journal.bupt.edu.cn/EN/10.13190/j.jbupt.2020-086