期刊文献+

基于内容预期价值的内容中心网络缓存替换策略

Content-Centric Network Cache Replacement Strategy based on Content-Expected Value
下载PDF
导出
摘要 缓存替换技术是内容中心网络的研究内容之一。相对于海量的内容数据,缓存空间总是有限的,良好的缓存替换策略可以提高缓存收益。考虑到内容在将来被请求的概率越大,预期访问时间距离当前时刻越近,其留存价值就越大,提出了一种基于内容预期价值的替换策略。该方案通过考虑内容流行度和预期访问时间到当前时刻的时间距离,构建内容预期价值函数,并据此将价值最小的内容替换出去。仿真实验证明,该策略相对于传统的缓存替换策略,可以有效提高缓存命中率、降低请求跳数,提高网络性能。 Cache replacement strategy is one of the research issues in content-centric networks.Compared with the massive amount of content data,the cache space is always limited,and good cache replacement strategies can increase cache gains.Considering that the greater the probability that the content is requested in the future,the closer the expected access time is to the current moment,the greater its retention value is,a replacement strategy based on the expected value of the content is proposed.This solution considers the content popularity and the time distance from the expected access time to the current moment to construct the expected value function of the content and replace the least valuable content accordingly.Simulation experiments indicate that this strategy can effectively improve the cache hit rate,reduce the number of request hops,and improve network performance compared to the traditional cache replacement strategy.
作者 王珂 江凌云 董唱 WANG Ke;JIANG Ling-yun;DONG Chang(College of Telecommunications&Information Engineering,Nanjing University of Posts and Telecommunication,Nanjing Jiangsu 210003,China)
出处 《通信技术》 2020年第3期678-683,共6页 Communications Technology
关键词 内容中心网络 缓存 缓存替换 内容价值 content-centric network cache cache replacement content value
  • 相关文献

参考文献2

二级参考文献29

  • 1P.T. Eugster, P.A. Felber, R. Guerraoui, and A.M. Kermarrec. The many faces of publish/subscribe. ACM Computing Surveys, 35(2):114-131, 2003.
  • 2H. Balakrishnan, K. Lakshminarayanan, S. Ratnasamy, S. Shenker, I. 5toica, and M. Walfish. A layered naming architecture for the internet. In Proceedings of the ACM Conference on Applications, Technologies, Architectures and Protocols for Computer Communications (SIGCOMM '04), Portland, OR, USA, August 2004, pages 343-352.
  • 3M. Walfisha, H. Balakrishnana, and S. Shenkerb. Untangling the web from dns. In Proceedings of the tst Symposium on Networked Systems Design and Implementation (NSDI '04), San Francisco, CA, USA, March 2004.
  • 4Bengt Ahlgren, Christian Dannewitz, Claudio Imbrenda, Dirk Kutscher, and Borje Ohlman. A survey of information-centric networking. IEEE Communications Magazine, 50(7):26-36, 2012.
  • 5George Xylomenos, C Ververidis, V Siris, Nikos Fotiou, Christos Tsilopoulos, Xenofon Vasilakos, K Katsaros, and G Polyzos. A survey of information-centric networking research. IEEE Communications Surveys and Tutorials, 16(2): 1-26, 2013.
  • 6V. Sourlas, P. Flegkas, G.S. Paschos, D. Katsaros, and L. Tassiulas. Storage planning and replica assignment in content-centric publish/subscribe networks. Elsevier Journal on Computer Networks, 55(18):4021-4032, 2011.
  • 7S. Arianfar, P. Nikander, and J. Ott. On content-centric router design and irnplications. In Proceedings of the Re-Architecting the Internet Workshop of the ACM CoNEXT Conference (ReArch '70), Philadelphia, USA, November 2070.
  • 8V. Jacobson, D.K. 5metters, J.D. Thornton, M.F. Plass, N.H. Briggs, and R.L. Braynard. Networking named content. In Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies (CoNEXT '09), Rome, Italy, December 2009, pages 1-12.
  • 9W. Chai, D. He, I. Psaras, and G. Pavlou. Cache "less for more" in information-centric networks. In Proceedings of the 77th International IFIP TC 6 Conference on Networking, Brooklyn, NY, USA, May 2072, pages 27-40.
  • 10V. Sourlas, G.S. Paschos, P. Flegkas, and L. Tassiulas. Caching in content- based publish/subscribe systems. In Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM '09), Honolulu, HI, USA, November 2009, pages 1-6.

共引文献17

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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