节点文献

基于节点社团重要度的ICN缓存策略

Caching strategy based on node’s importance to community in information-centric networks

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 蔡君余顺争刘外喜

【Author】 CAI Jun;YU Shun-zheng;LIU Wai-xi;School of Electronic and Information,Guangdong Polytechnic Normal University;Department of Electronics and Communication Engineering,Sun Yat-Sen University;Department of Electronic and Information Engineering,Guangzhou University;

【机构】 广东技术师范学院电子与信息学院中山大学电子与信息工程系广州大学电子信息工程系

【摘要】 全网内置缓存是ICN(信息中心网络)架构中最重要的特性之一。为使被缓存的内容对象在空间和时间上分布更合理,提出了一种基于节点社团重要度的缓存策略(CSNIC)。该策略以社团为单位,不仅把内容缓存到社团内用户容易获取的节点处,而且使不同流行度的内容对象在各社团内节点处的时间分布上更合理。在多种实验条件下对CSNIC策略进行了仿真验证,结果表明该策略与CEE-LRU、Betw-LFU、Opportunistic相比,能更好地提升包括缓存命中率、跳数减少率、内容差异性及替换数量等在内的网络缓存性能指标,而且,CSNIC策略的额外开销较小。

【Abstract】 In-network caching is one of the most important features of ICN(information-centric networks). A caching strategy based on node’s importance to community was proposed to make content objects cached more reasonable in temporal and spatial distribution. Within each community, the strategy not only caches content objects in those nodes where users are easy to access the content, but also makes different popularity of content objects more reasonable in temporal distribution. The CSNIC strategy was implemented under a variety of experimental conditions, and compare it with the previous strategies CEE-LRU, Betw-LFU and Opportunistic. The simulation results show that the strategy can yield a significant performance improvement, such as, cache hit ratio, hop reduction ratio, content diversity ratio and number of replacement. Furthermore, the additional overhead of CSNIC is small.

【基金】 广东省自然科学基金资助项目(S2012040007184,2014A030313637);广东省教育厅特色创新基金资助项目(2014KTSCX149)~~
  • 【文献出处】 通信学报 ,Journal on Communications , 编辑部邮箱 ,2015年06期
  • 【分类号】TP393.02
  • 【被引频次】25
  • 【下载频次】346
节点文献中: 

本文链接的文献网络图示:

本文的引文网络