面向新生内容需求的缓存放置与替换联合算法

在内容中心网络中，全局缓存放置算法无法对新生内容实时缓存放置进行优化，对此，提出一种缓存放置与替换的联合优化算法，可减小缓存节点业务负载和用户内容获取的时延.定义了整网缓存收益函数，构建了最大化整网缓存收益的最优化问题，以实现新生内容的缓存放置与已存内容的缓存替换.为了求解所提的优化问题，将所提优化问题分解为缓存放置子问题和缓存替换子问题，提出了一种全局缓存放置优化问题的次优解，缓存放置算法的性能下限为（1-1/e）倍的最优解.在缓存放置之后考虑多点协同的缓存替换算法，最小化由于缓存替换产生的缓存损失，最后通过迭代实现缓存放置与替换的联合优化.仿真结果表明，所提联合优化算法可以提升整网缓存收益，在缓存节点负载、内容获取平均跳数和全网缓存命中率方面均优于传统方法.

A Joint Cache Placement and Replacement Algorithm for Cache Requirements of New Contents in CCN

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.