期刊文献+

基于内容流行度和节点重要度的CCN缓存策略 被引量:3

A Caching Scheme Based on Content Popularity and Betweenness in Content Centric Network
下载PDF
导出
摘要 内容中心网络(content centric network,CCN)强调以内容资源本身为中心,CCN网络在路由节点对内容进行缓存,使内容接近用户,因而缓存策略研究成为CCN网络的关键技术之一。传统的主流缓存策略Always(处处缓存)、LCD(leave copy down)都会很大程度上造成节点空间的浪费和缓存内容的冗余。改进的Betw(betweenness)方案仅考虑了节点介数,容易造成两个问题:一是导致最流行的内容只缓存在高介数的节点,无法到达最靠近用户的位置;二是导致高介数的节点缓存更换频繁,流行内容缓存时间短。为了解决这一问题,提出一种内容流行度与节点重要度相结合的缓存机制,实现优化的缓存协作。在ndnSIM平台进行仿真,结果表明该方案提高了路由节点缓存命中率,减小了获取内容的平均跳数。 Content center network( CCN) emphasizes the content resource itself as the center.CCN network caches the content in the routing node in order to make the content close to the user,so the cache scheme research has become one of the key technologies of CCN network.The traditional mainstream cache strategy like Always( always cached),LCD( leave copy down) will be largely caused by the waste of node space and the redundancy of content.The improved scheme Betwonly takes into account the betweenness,which can lead to two main problems: one is that the most popular content is only cached in the node with the lager betweenness,which can not reach the nearest user position; the other is that the Betwhas the more frequent replacement,which will decrease the time of the content cache in node.For this,we propose a coporate caching scheme considering content popularity and betweenness to realize optimized cache cooperation.The simulation on the ndn SIMplatform shows that the proposed scheme improves the hit rate of the routing node and reduces the average hop count for getting the content.
作者 郑凯月 潘沛生 ZHENG Kai-yue;PAN Pei-sheng(School of Telecommunications & Information Engineering,Nanjing University of Posts and Telecommunications,Nanjing 210003,China)
出处 《计算机技术与发展》 2018年第6期73-76,共4页 Computer Technology and Development
基金 江苏省高校自然科学基础研究计划重大项目(08KJD510001)
关键词 内容中心网络 内容流行度 节点重要度 协作缓存 流行度排名 CCN content popularity betweenness corporate cache popularity ranking
  • 相关文献

参考文献8

二级参考文献78

  • 1林闯,任丰原.可控可信可扩展的新一代互联网[J].软件学报,2004,15(12):1815-1821. 被引量:79
  • 2林闯,彭雪海.可信网络研究[J].计算机学报,2005,28(5):751-758. 被引量:252
  • 3林闯,汪洋,李泉林.网络安全的随机模型方法与评价技术[J].计算机学报,2005,28(12):1943-1956. 被引量:92
  • 4林闯,雷蕾.下一代互联网体系结构研究[J].计算机学报,2007,30(5):693-711. 被引量:64
  • 5Koponen T, Chawla M, Gon C B, et al.. A data-oriented (and beyond) network architecture[C]. Proceedings of the ACM SIGCOMM 2007 Conference, Kyoto, Japan, 2007: 181-192.
  • 6European Union. Project FP7 4WARD[OL]. http://www. 4ward-project.eu, 2010.
  • 7European Union. Project PSIRP [OL]. http://www.psirp.org, 2010.
  • 8Jacobson V, Smetters D K, Thornton J D, et al.. Networking named content[C]. Proceedings of the 5th International Conference on Emerging Networking Experiments andTechnologies, Rome, Italy, 2009:1 12.
  • 9Jacobson V, Smetters D K, Thornton J D, et al.. Networking named content [J]. Communications of the A CM, 2012, 55(1): 117 124.
  • 10Psaras I, Clegg R G, Landa R, et al.. Modeling and evaluation of CCN-taching trees[C]. Proceedings of the 10th International IFIP TC 6 Conference on Networking, Valencia Spain, 2011: 78-91.

共引文献126

同被引文献21

引证文献3

二级引证文献8

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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