计算机科学 ›› 2016, Vol. 43 ›› Issue (4): 81-85.doi: 10.11896/j.issn.1002-137X.2016.04.016

• 网络与通信 • 上一篇    下一篇

内容中心网络中基于节点相似度的协作缓存算法

方馨蔚,陈庶樵,任泽荣,江逸茗   

  1. 国家数字交换系统工程技术研究中心 郑州450000,国家数字交换系统工程技术研究中心 郑州450000,国家数字交换系统工程技术研究中心 郑州450000,国家数字交换系统工程技术研究中心 郑州450000
  • 出版日期:2018-12-01 发布日期:2018-12-01
  • 基金资助:
    本文受国家重点基础研究发展计划(“973”计划)基金资助

Collaborative Caching Algorithm Based on Node Similarity in Content Centric Networking

FANG Xin-wei, CHEN Shu-qiao, REN Ze-rong and JIANG Yi-ming   

  • Online:2018-12-01 Published:2018-12-01

摘要: 针对内容中心网络中ALWAYS缓存策略节点存储空间利用率低、内容访问时延大、整体网络缓存性能低下的问题,提出了一种依据节点相似度的协作缓存算法。该算法优先将兴趣包转发至最相似节点,增大相关请求的就近响应概率;同时保证在缓存决策中的同一副本在协作节点间不重复存储,在降低冗余的同时增加了缓存多样性。实验结果表明,与现有算法相比,该算法在减少路由跳数和请求时延的同时提高了缓存命中率。

关键词: 内容中心网络,协作缓存,缓存决策,节点相似度

Abstract: The default ALWAYS caching scheme (caching everything everywhere) in CCN results in the low storage utilization,the large content access latency and the inefficient caching performance as well.This paper proposed a colla-borative caching algorithm based on node similarity (CCANS).The interest packet is forwarded to the most similar node to increase the hit rate for correlate requests.Curbing the same duplication between collaborative nodes,the algorithm reduces the redundancy while increasing the diversity.The simulation results show that,compared with the exis-ting algorithm,the proposed algorithm decreases the route hops,reduces the request latency and achieves higher cache hit ratio.

Key words: Content centric networking,Collaborative caching,Caching strategy,Node similarity

[1] Jacobson V,Smetters D K,Thronton J D,et al.Networkingnamed content[C]∥Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies (CoNEXT’09).New York,NY,USA:ACM,2009:1-12
[2] Liu Wai-xi,Yu Shun-zheng,Hu Xiao,et al.Selective Caching in Content-Centric Networking[J].Chinese Journal of Computers,2013,37(2):275-288(in Chinese) 刘外喜,余顺争,胡晓,等.CCN中选择性缓存机制的研究[J].计算机学报,2013,37(2):275-288
[3] Xylomenos G,Ververidis C,Siris V,et al.A survey of information-centric networking research[J].IEEE Communications Surveys & Tutorials,2014,16(2):1024-1049
[4] Psaras I,Chai W K,Pavlou G.Probabilistic in-network caching for information-centric networks[C]∥Proc.of the 2nd ICN Workshop on Information-Centric Networking.2012:55-60
[5] Fayazbakhsh S K,et al.Less pain,most of the gain:Incrementally deployable ICN[J].ACM SIGCOMM Computer Communication Review,2013,43(4):147-158
[6] Tang X,Chanson S T.Coordinated en-route Web caching[J].IEEE Trans.on Computers,2002,1(6):595-607
[7] Wang S,Bi J,Wu J P.Collaborative caching based on hash-routing for information-centric networking[C]∥Proc.of the ACM SIGCOMM.2013:535-536
[8] Wang J M,Zhang J,Bensaou B.Intra-AS cooperative caching for content-centric networks[C]∥Proc.of the 3rd ACM SIGCOMM Workshop on Information-Centric Networking (ICN 2013).2013:61-66
[9] Li Z,Simon G.Time-Shifted TV in content centric networks:The case for cooperative in-network caching[C]∥Proc.of the 2011 IEEE Int’l Conf.on Communications (ICC).2011:1-6
[10] Ming Z,Xu M,Wang D.Age-Based cooperative caching in information-centric network[C]∥Proc.of the IEEE INFOCOM Workshop on NOMEN.2012:268-273
[11] Cho K,Lee M,Park K,et al.WAVE:Popularity-Based and collaborative in-network caching for content-oriented networks[C]∥Proc.of the IEEE INFOCOM Workshop on NOMEN.2012
[12] Zhu Yi,Mi Zheng-kun,Wang Wen-nai.A cache probability replacement policy based on content popularity in content centric networks[J].Journal of Electronics & Information Technology,2013,35(6):1305-1310
[13] Liu Wai-xi,Yu Shun-zheng,Cai Jun,et al.Scheme for Cooperative Caching in ICN[J].Journal of Software,2013,24(8):1947-1962(in Chinese) 刘外喜,余顺争,蔡君,等.ICN中的一种协作缓存机制[J].软件学报,2013,24(8):1947-1962
[14] Zhang Li-xia,Estrin D,Burke J.Named data networking(NDN) project:PARC NDN-0001[R].2010
[15] Afanasyev A,Moiseenko I,Zhang L X.ndnSIM:NDN simulator for NS-3:NDN-0005[R].NDN,2012

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!