期刊文献+

基于节点介数与边缘流行度的NDN缓存策略 被引量:6

NDN Caching Strategy Based on Node Median and Edge Popularity
下载PDF
导出
摘要 针对命名数据网络(NDN)架构中多数缓存策略的冗余与低效问题,提出一种基于节点介数与边缘内容流行度的缓存放置策略BEP。结合节点的介数中心性与内容的动态流行度,同时考虑缓存的过滤作用,将最流行的内容放置在最重要的节点上,以高效利用稀缺的缓存资源。仿真结果表明,与经典NDN缓存策略LCE、LCD相比,BEP能有效提高缓存命中率,降低服务器负载。 Aiming at the redundancy and inefficiency of most caching strategy in Named Data Networking(NDN) architecture,a caching placement strategy BEP based on node median and edge content popularity is proposed.Combining the median centrality of node with the dynamic popularity of content,and considering the filtering effect of caches,the most popular content is placed on the most important node to make efficient use of scarce cache resources.Simulation results show that compared with the classical NDN caching strategies LCE and LCD,BEP can effectively improve the cache hit rate and reduce the server load.
作者 陈劼博 郑烇 王嵩 CHEN Jiebo;ZHENG Quan;WANG Song(Laboratory for Future Networks,Department of Automation,University of Science and Technology of China,Hefei 230026,China)
出处 《计算机工程》 CAS CSCD 北大核心 2019年第5期46-51,共6页 Computer Engineering
基金 国家自然科学基金重点项目"三网融合业务接入系统的分析 建模与调控"(61233003)
关键词 命名数据网络 缓存 节点中心性 流行度 缓存决策 网络边缘 Named Data Networking(NDN) caching node centrality popularity caching decision network edge
  • 相关文献

参考文献3

二级参考文献42

  • 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.

共引文献46

同被引文献25

引证文献6

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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