期刊文献+

基于流行内容感知和跟踪的协同缓存策略 被引量:6

Coordinated caching scheme based on popular content awareness and tracking
下载PDF
导出
摘要 针对内容中心网络(CCN,content centric networking)中沿路径缓存策略存在的问题,设计了一种最大介数节点和边缘节点协同的缓存策略。根据网络拓扑特性,在最大介数节点感知流行内容,边缘节点协同跟踪;依据内容流行度和缓存空间,指定内容在传输路径的存储位置。仿真实验表明,与经典算法相比,该策略有效提高了缓存命中率,同时降低了平均路由跳数比,改善了缓存系统的效率。 To overcome the problems of the on-path caching schemes in the content centric networking,a coordinated caching scheme based on the node with the max betweenness value and edge node was designed.According to the topology characteristics,the popular content was identified at the node with the max betweenness value and tracked at the edge node.The on-path caching location was given by the popularity and the cache size.Simulation results show that,compared with the classical schemes,this scheme promotes the cache hit ratio and decreases the average hop ratio,thus enhancing the efficiency of the cache system.
出处 《通信学报》 EI CSCD 北大核心 2017年第2期132-142,共11页 Journal on Communications
基金 国家自然科学基金创新研究群体基金资助项目(No.61521003) 国家重点基础研究发展计划("973"计划)基金资助项目(No.2012CB315901 No.2013CB329104) 国家自然科学基金资助项目(No.61372121 No.61309019 No.61309020 No.61572519 No.61502530) 国家高技术研究发展计划("863"计划)基金资助项目(No.2015AA016102 No.2013AA013505)~~
关键词 内容中心网络 沿路径协同缓存 流行内容 感知与跟踪 content centric networking on-path coordinated caching popular content awareness and tracking
  • 相关文献

参考文献6

二级参考文献95

  • 1Jacobson V,Smetters D K,Thornton J D. Networking named content[A].{H}Rome,Italy,2009.1-12.
  • 2Yi C,Afanasyev A,Wang L. Adaptive forwarding in named data networking[J].ACM SIGCOMM Computer Communication Review,2012,(3):62-67.
  • 3Kideok Cho,Lee Mun-young,Park Kun-woo. WAVE:popularity-based and collaborative in-network caching for content-oriented networks[A].2012.316-321.
  • 4Dan A,Towsley D. An approximate analysis of the lru and fifo buffer replacement schemes[A].Boulder,1990.143-152.
  • 5Leet Dong-hee,Choit Jong-moo,Kim Jong-hun. On the existence of a spectrum of policies that subsumes the Least Rrecently Used(LRU)and Least Frequently Used(LFU)policies[A].Atlanta,1999.134-143.
  • 6Jelenkovic P,Radovanovic A,Squillante M S. Critical sizing of lru caches with dependent requests[J].{H}Journal of Applied Probability,2006,(4):1013-1027.
  • 7Lee Breslau,Pei Cao,Li Fan. Web caching and Zipf-like distributions:evidence and implications[A].NewYork,1999.126-134.
  • 8Laoutaris N,Syntila S,Stavrakakis I. Meta algorithms for hierarchical web caches[A].2004.445-452.
  • 9Chai Wei-koong,He Di-liang,Ioannis P. Cache“Less for More” in information-centric networks[A].Prague,2012.27-40.
  • 10Chai Wei-koong,He Di-liang,Ioannis P. Cache“Less for More” in information-centric networks(extended version)[J].{H}Computer Communications,2013,(7):758-770.

共引文献63

同被引文献22

引证文献6

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部