cooperativecaching among nodes is a hot topic in Content Centric Networking (CCN). However, the cooperativecaching mechanisms are performed in an arbitrary graph topology, leading to the complex cooperative operatio...
详细信息
cooperativecaching among nodes is a hot topic in Content Centric Networking (CCN). However, the cooperativecaching 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 cooperativecachingalgorithm 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 cachesduplicatedcontents and the other cachesuniquecontents. 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 cachingalgorithm. Finally, simulation results show that the proposed cachingalgorithm can perform better than some traditional caching strategies.
暂无评论