基于内容价值的缓存替换策略

缓存替换机制是内容中心网络的重要研究问题之一，考虑到缓存空间的有限性，合理地对缓存内容进行置换，成为影响网络整体性能的关键因素。因此，设计了一种基于内容价值的缓存替换方案。该方案综合考虑了内容的动态流行度、缓存代价以及最近被请求的时间，构建了更实际的内容价值函数，并依据该内容价值函数，设计了有效的内容存储与置换方案。具体地，当缓存空间不足时，对已有缓存内容按照价值从小到大进行置换。仿真结果表明，相比于传统替换算法 LRU、LFU 和 FIFO，本文提出的方案有效地提升了网络节点的内容缓存命中率，降低了用户获取内容的平均跳数。

Cache replacement strategy based on content value

The cache replacement mechanism is one of the important research issues of the content center network.Considering the limited cache space,the reasonable replacement of the cache content becomes a key factor affecting the overall performance of the network.Therefore,a cache replacement scheme based on content value was designed.Considering the dynamic popularity of content,the cost of caching,and the time of the most recently requested,a more realistic content value function was built,and an effective content storage and replacement scheme was designed based on the content value function.Specifically,when the cache space was insufficient,the existing cache contents were replaced according to the value from small to large.Simulation results show that compared with the traditional replacement algorithms LRU,LFU and FIFO,the proposed scheme effectively improves the content cache hit rate of network nodes and reduces the average hops of users’ content acquisition.