Cooperative caching among nodes is a hot topic in Content Centric Networking (CCN). However, the cooperative caching mechanisms are performed in an arbitrary graph topology, leading to the complex cooperative operation. For this reason, hierarchical CCN has received widespread attention, which provides simple cooperative operation due to the explicit affiliation between nodes. In this study, the authors propose a heuristic cooperative caching algorithm for maximising the average provider earned profit under the two-level CCN topology. This algorithm divides the cache space of control nodes into two fractions for caching contents which are downloaded from different sources. One fraction caches duplicated contents and the other caches unique contents. The optimal value of the split factor can be obtained by maximising the earned profit. Furthermore, they also propose a replacement policy to support the proposed caching algorithm. Finally, simulation results show that the proposed caching algorithm can perform better than some traditional caching strategies.

中文翻译：

---

面向内容的分层网络的面向利益的协作缓存算法

节点之间的协作缓存是内容中心网络（CCN）中的热门话题。但是，协作缓存机制是在任意图拓扑中执行的，从而导致复杂的协作操作。因此，分层CCN受到了广泛的关注，由于节点之间的显式关联，它提供了简单的协作操作。在这项研究中，作者提出了一种启发式协作缓存算法，用于在两级CCN拓扑下最大化平均提供商获得的利润。该算法将控制节点的缓存空间分为两个部分，用于缓存从不同来源下载的内容。一分之一缓存重复的 内容和其他缓存 独特内容。分割因子的最佳值可以通过使所赚取的利润最大化来获得。此外，他们还提出了一种替换策略来支持所提出的缓存算法。最后，仿真结果表明，所提出的缓存算法的性能优于某些传统的缓存策略。