【24h】

HD: A Cache Storage Strategy Based on Hierarchical Division in Content-centric Networking

机译:HD:以内容为中心的网络中基于分层划分的缓存存储策略

获取原文
获取原文并翻译 | 示例

摘要

As a promising direction of future Internet, Content-Centric Network (CCN) has attracted world-wide attention. In-network caching is an important feature of CCN network, which has significant impacts on the performance of content transmission. Existing researches on in-network caching either have no regard for the collaboration or need giant additional overhead for global optimization. This paper proposes a hierarchical division-based cache storage strategy, called HD, which allows the contents can be cached in different nodes by grouping contents into different hierarchies. HD aims to reduce propagation delay and server load by light-weight collaboration mechanisms that allows the popular contents could be cached along the path with certain a probability. The performance of HD scheme was evaluated by comparing with the well-known schemes through simulation. The experimental results indicate that HD strategy can save up to 30.77% hop reduction ratio, 44.93% average cache hit ratio and 11.88% server hit ratio while the parameter α of Zipf distribution is increasing.
机译:作为未来Internet的一个有前途的方向,以内容为中心的网络(CCN)引起了全世界的关注。网络内缓存是CCN网络的重要功能,它对内容传输的性能产生重大影响。关于网络内缓存的现有研究要么不考虑协作,要么需要巨大的额外开销来进行全局优化。本文提出了一种基于分层划分的缓存存储策略,称为HD,该策略通过将内容分为不同的层次结构,可以将内容缓存在不同的节点中。 HD旨在通过轻量级协作机制来减少传播延迟和服务器负载,该机制允许将流行内容以一定概率沿路径缓存。通过与仿真方案进行比较,评估了高清方案的性能。实验结果表明,随着Zipf分布参数α的增加,HD策略最多可以节省30.77%的跳数减少率,44.93%的平均高速缓存命中率和11.88%的服务器命中率。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号