期刊文献+

基于缓存开销的信息中心网络缓存协作策略 被引量:1

Cooperative Caching Strategy Based on Cache Cost for Information-Centric Networking
下载PDF
导出
摘要 网络化缓存策略影响ICN网络的传输性能,考虑到缓存执行时的开销不仅包含访问缓存节点时的路径代价,还应包含替换旧信息的替换代价,因此提出一种基于路径访问代价和节点替换代价的缓存协作策略(path and node cost based cooperative caching strategy,简称PNC3S).该策略对两种代价进行整体考虑,将代价总量作为是否进行信息与节点匹配缓存的依据,对提出的策略模型进行优化分析,将最优解作为缓存部署方案.实验结果表明,与CEE,LCD策略相比,PNC3S可以改善网络的信息缓存率、服务器的负载率、网络链路平均利用率,以及访问跳数减少率. In-network caching is one of the core issues in information-centric networking( ICN)which will directly restrict the data dissemination performance of the network. Considering the cache cost contains not only the path cost raised by accessing a cache node on the path but also the replacement cost of old information,a path and node cost based cooperative caching strategy( PNC3 S) is proposed. The PNC3 S considers the path cost and replacement cost comprehensively,and whether information matches a node or not depends on the total cost. Then the optimization algorithm is introduced into the proposed strategy to make caching decision. The simulation experiments demonstrate that the proposed PNC3 S,compared with CEE( cache everything everywhere) and LCD( leave copy down),improves such performance as cached information ratio,server load ratio,average link utilization ratio and hop reduction ratio.
作者 蔡凌 汪晋宽 王兴伟 韩来权 CAI Ling;WANG Jin-kuan;WANG Xing-wei;HAN Lai-quan(School of Control Engineering,Northeastern University at Qinhuangdao,Qinhuangdao 066004,China;School of Information Science & Engineering,Northeastern University, Shenyang 110819,China;School of Software,Northeastern University,Shenyang 110169,China;School of Computer and Communication Engineering,Northeastern University at Qinhuangdao,Qinhuangdao 066004,China.)
出处 《东北大学学报(自然科学版)》 EI CAS CSCD 北大核心 2018年第2期166-171,共6页 Journal of Northeastern University(Natural Science)
基金 国家杰出青年科学基金资助项目(61225012 71325002) 河北省高等学校科学技术研究项目(QN2014327)
关键词 信息中心网络 缓存网络 缓存开销 缓存策略 优化算法 information-centric networking (ICN) caching network cache cost caching strategy optimization algorithm
  • 相关文献

参考文献2

二级参考文献21

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

共引文献43

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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