基于内容分块流行度分级的信息中心网络缓存策略
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:LICA: A Segment-Popularity Based Caching Scheme in ICN
  • 作者:曾宇晶 ; 靳明双 ; 罗洪斌
  • 英文作者:ZENG Yu-jing;JIN Ming-shuang;LUO Hong-bin;National Engineering Lab for Next Generation Internet Interconnection Devices,Beijing Jiaotong University;
  • 关键词:内容为中心网络 ; 域内缓存 ; 流行度
  • 英文关键词:information centric networking;;in-network caching;;segment popularity
  • 中文刊名:DZXU
  • 英文刊名:Acta Electronica Sinica
  • 机构:北京交通大学下一代互联网互连设备国家工程实验室;
  • 出版日期:2016-02-15
  • 出版单位:电子学报
  • 年:2016
  • 期:v.44;No.396
  • 基金:国家973重点基础研究发展计划(No.2013CB329100);; 国家自然科学基金重点项目(No.61271200;No.61422101;No.61232017)
  • 语种:中文;
  • 页:DZXU201602017
  • 页数:7
  • CN:02
  • ISSN:11-2087/TN
  • 分类号:120-126
摘要
信息中心网络(ICN:Information-Centric Networking)域内缓存机制的研究大多假定单个内容的流行度相同,而忽视了同一内容的不同分块具有不同流行度的特性.本文提出了一种基于内容分块流行度以及缓存节点位置的分级缓存策略,通过兴趣包和数据包携带标签的方式实现隐式缓存协作.仿真实验证明相比于其他方案,该方案可以充分利用细粒度的内容分块流行度这一特性,提高缓存路由器缓存命中率,减小用户请求内容时延以及网络流量,进而提升用户对实时业务的服务体验.
        In-network caching schemes in information-centric networking( ICN) often consider the popularity granularity in the content level,which ignores the character that different parts of a content may have different popularity. This paper proposes a segment Level-based Implicit Cooperation c Ache( LICA) scheme. LICA assigns a cache router a level based on its location and archives implicit cooperation with tags in interest and data packets. We compare LICA with other caching schemes and the simulation results showthat LICA has higher average hit ratio,lower average hop count of content retrieval,and reduces the network traffic than other schemes,which will improve the experience of users in real-time streaming media service.
引文
[1]Zhang L X,Estrin D,Burke J,et al.Named Data Networking(NDN)project[R].California:PARC,2010.
    [2]Koponen T,Chawla M,Chun B.G,et al.A data-oriented(and beyond)network architecture[J].SIGCOMM Comput Commun Rev,2007,37(4):181-192.
    [3]Lagutin D,Visala D,Tarkoma S.Publish/subscribe for internet:Psirp perspective[R].Tow ards the Future Internet Emerging Trends from European Research,2010(4):75-84.
    [4]Laoutaris N,Syntila S,Stavrakakis I.Meta algorithms for hierarchical w eb caches[A].Proceedings of 2004 IEEE International Conference on Performance,Computing,and Communications[C].Phoenix,2004.445-452.
    [5]Chae Y,Guo K,Buddhikot M M,et al.Silo,rainbow,and caching token:Schemes for scalable,fault tolerant stream caching[J].Selected Areas in Communications,IEEE Journal on,2002,20(7):1328-1344.
    [6]Zhang G,Li Y,Lin T.Caching in information centric netw orking:a survey[J].Computer Netw orks,2013,57(16):3128-3141.
    [7]Long Y,Fan L,Yan Z.Off-path and on-path collaborative caching in named data netw ork[A].Proceedings of Asia FI[C].Kyoto,2012.1-8.
    [8]Vassilakis V G,Al-Naday M F,Reed M J,et al.A cache-aw are routing scheme for information-centric netw orks[A].Proceedings of 2014 9th International Symposium on Communication Systems,Netw orks&Digital Signal Processing(CSNDSP)[C].Manchester,2014:721-726.
    [9]Psaras I,Chai,Wei Koong,Pavlou G.Probabilistic in-netw ork caching for information-centric netw orks[A].Proceedings of the Second Edition of the ICN Workshop on Information-centric Netw orking[C].Helsinki,2012.55-60.
    [10]Cho K,Lee M,Park K,et al.Wave:Popularity-based and collaborative in-netw ork caching for content-oriented netw orks[A].Proceedings of 2012 IEEE Conference on Computer Communications Workshops(INFOCOM WKSHPS)[C].Orlando,2012.316-321.
    [11]Li Yang,Lin Tao,Tang Hui,et al.A chunk caching location and searching scheme in content centric netw orking[A].Proceeding of 2012 IEEE International Conference on Communications(ICC)[C].Ottaw a,2012.2655-2659.
    [12]Ming Zhong-xing,Xu Ming-wei;Wang Dan.Age-based cooperative caching in Information-Centric Netw orks[A].Proceedings of 2012 IEEE Conference on Computer Communications Workshops(INFOCOM WKSHPS)[C].Orlando,2012.268-273.
    [13]Wang Wei,Sun Yi,Guo Yang,et al.CRCache:Exploiting the correlation betw een content popularity and netw ork topology information for ICN caching[A].Proceeding of2014 IEEE International Conference on Communications(ICC)[C].Sydney,2014.3191-3196.
    [14]Bilal M,Kang S G.Time Aware Least Recent Used(TLRU)cache management policy in ICN[A].Proceeding of2014 16th International Conference on Advanced Communication Technology(ICACT)[C].Pyeong Chang Korea,2014.528-532.
    [15]Lim Sung-Hwa,Ko Young-Bae,Jung Gue-Hwan,et al.Inter-Chunk Popularity-Based Edge-First Caching in Content-Centric Netw orking[J].IEEE Communications Letters,2014,18(8):1331-1334.
    [16]Breslau L,Cao P,Fan L,et al.Web caching and zipf-like distributions:evidence and implications[A].Proceedings of INFOCOM'99[C].New York,1999.126-134.
    [17]Xylomenos G,Ververidis C,Siris V,et al.A Survey of Information-Centric Netw orking Research[J].IEEE Communications Surveys and Turorials,2014,16(2):1024-1049.
    [18]Ahlgren B,Dannewitz C,Imbrenda C,et al.A Survey of Information-Centric Netw orking[J].IEEE Communications M agazine,2012,50(7):26-36.
    [19]Luo H,Chen Z,Cui J,et al.Co LoR:an information-centric Internet architecture for innovations[J].IEEE Netw ork M agazine,2014,28(3):4-10.
    [20]Ketan S,Mitra A,Matani D.An O(1)algorithm for implementing the LFU cache eviction scheme[OL].http://dhruvbird.com/lfu.pdf,2010.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700