A Novel In-network Caching Scheme Based on Betweenness and Replacement Rate in Content Centric Networking
-
摘要: 网内缓存技术是内容中心网络(CCN)的关键技术之一，CCN采用传统的ALWAYS缓存策略，会造成较大冗余。改进的Betw方案仅考虑了节点介数，容易造成高介数节点缓存更替频繁，内容可用性下降。为了解决这个问题，该文提出一种综合使用网络节点介数和节点缓存内容更替速率作为缓存决策度量的新型网内缓存策略BetwRep，通过权衡节点位置重要性和缓存内容时效性实现回传内容的最佳放置。最后，基于ndnSIM平台进行的网络仿真表明，该文提出的BetwRep缓存策略取得了比Betw方案和ALWAYS方案更低的源端请求负载和更少的平均跳数。
-
关键词:
- 内容中心网络 /
- 网内缓存技术 /
- BetwRep缓存策略 /
- 节点介数 /
- 缓存替换率
Abstract: In-network caching is one of the key aspects of Content Centric Networking (CCN), which is widely concerned recently. However, the ALWAYS caching scheme (caching everywhere on the delivery path) in CCN produces a great of redundancy, while the Betw scheme leads to that the node has the more frequent replacement with the larger betweenness centrality, which will decrease the availability of the content. In this paper, a novel in-network caching scheme named BetwRep is proposed based on a metric including the betweenness centrality and the replacement rate of one node to address the problem-where to cache along the delivery path. Simulation experiment based on ndnSIM demonstrates that the BetwRep caching scheme achieves the lower loading in the source server and less average hops than that of Betw scheme and ALWAYS scheme. -
计量
- 文章访问数: 2781
- HTML全文浏览量: 137
- PDF下载量: 2238
- 被引次数: 0
下载:
