基于内容流行度和节点中心度匹配的信息中心网络缓存策略

芮兰兰; 彭昊; 黄豪球; 邱雪松; 史瑞昌

doi:10.11999/JEIT150626

基于内容流行度和节点中心度匹配的信息中心网络缓存策略

doi: 10.11999/JEIT150626

基金项目:

国家自然科学基金(61302078, 61372108)，国家863计划(2011AA01A102)，国家科技重大专项(2011ZX03005-004-02)，北京高等学校青年英才计划项目(YETP0476)

计量
- 文章访问数: 1517
- HTML全文浏览量: 165
- PDF下载量: 1001
- 被引次数: 0
出版历程
- 收稿日期: 2015-05-27
- 修回日期: 2015-11-09
- 刊出日期: 2016-02-19

Popularity and Centrality Based Selective Caching Scheme for Information-centric Networks

Funds:

The National Natural Science Foundation of China (61302078, 61372108), The National 863 Program of China (2011AA01A102), The National ST Major Project (2011ZX 03005-004-02), Beijing Higher Education Young Elite Teacher Project (YETP0476)

摘要

摘要: 在信息中心网络(Information-Centric Network, ICN)中，利用网络内置缓存提高内容获取及传输效率是该网络构架最重要的特性。然而，网络内置的缓存存在应对大量的需要转发的内容时能力相对弱小，对内容放置缺乏均衡分布的问题。该文提出基于内容流行度和节点中心度匹配的缓存策略(Popularity and Centrality Based Caching Scheme, PCBCS)，通过对经过的内容进行选择性缓存来提高内容分发沿路节点的缓存空间使用效率，减少缓存冗余。仿真结果表明，该文提出的算法和全局沿路缓存决策方案，LCD(Leave Copy Down)以及参数为0.7及0.3的Prob(copy with Probability)相比较，在服务器命中率上平均减少30%，在命中缓存内容所需的跳数上平均减少20%，最重要的是，和全局沿路缓存决策方案相比总体缓存替换数量平均减少了40%。
- 信息中心网络 /
- 缓存网络 /
- 缓存决策策略 /
- 时空局部性
Abstract: Information-Centric Network (ICN) architectures seek to provide the necessary foundations for a more cost-efficient content acquirement and content distribution using universal in-network caching, also universal in-network caching is a key design principle of many such architectures. Given that caching capacity of ICN is relatively small in comparison to the amount of forwarded content, a key aspect is balanced distribution of content among the available caches. The in-network caching resolution scheme is proposed in this paper, based on content popularity and nodes centrality, called PCBCS. It reduces caching redundancy and in turn, make more efficient utilization of available cache resources along a delivery path through selective caching of content passing. The proposed algorithm is compared with universal on-path caching and Leave Copy Down (LCD), also Prob (copy with probability) scheme with parameter of 0.7 and 0.3. The results show reduction of up to 30% in server hits, and up to 20% in the number of hops required to hit cached contents, but, most importantly, reduction of cache replacements up to 40% in comparison to universal caching.
- Information-Centric Network (ICN) /
- Caching network /
- Caching resolution strategy /
- Spatiotemporal locality of reference

HTML全文

参考文献(19)

张国强, 李杨, 林涛, 等. 信息中心网络中的内置缓存技术研究[J]. 软件学报, 2014, 25(1): 154-175. doi: 10.13328/j.cnki. jos.004494.

ZHANG Guo-qiang, LI Yang, LIN Tao, et al. Survey of in-network caching techniques in information-centric networks[J]. Journal of Software, 2014, 25(1): 154-175. doi: 10.13328/j.cnki.jos.004494.

KUROSE J. Information-centric networking: The evolution from circuits to packets to content[J]. Computer Networks, 2014, 66: 112-120.

TANG X and CHANSON S T. Coordinated en-route Web caching[J]. IEEE Transactions on Computers, 2002, 51(6): 595-607.

WANG S, BI J, and WU J. Collaborative caching based on hash-routing for information-centric networking[C]. Proceedings of the 2013 ACM SIGCOMM, Hong Kong, 2013: 535-536.

PAVIOU G, PSARAS I, and WEI K C. Probabilistic in-network caching for information-centric networks[C]. Proceedings of ACM SIGCOMM ICN Workshop, Helsinki, 2012: 55-60.

崔现东, 刘江, 黄韬, 等. 基于节点介数和替换率的内容中心网络网内缓存策略[J]. 电子与信息学报, 2014, 36(1): 1-7. doi: 10.3724/SP.J.1146.2013.00503.

CUI Xiandong, LIU Jiang, HUANG Tao, et al. A novel in-network caching scheme based on betweenness and replacement rate in content centric networking[J]. Journal of Electronics Information Technology, 2014, 36(1): 1-7. doi: 10.3724/SP.J.1146.2013.00503.

HU Q, WU M, WANG D, et al. Lifetime-based greedy caching approach for content-centric networking[C]. 21st International Conference on Telecommunications, Lisbon, 2014: 426-430.

葛国栋, 郭云飞, 刘彩霞. 内容中心网络中面向隐私保护的协作缓存策略[J]. 电子与信息学报, 2015, 37(5): 1220-1226. doi. 10.11999/JEIT140874.

GE Guodong, GUO Yunfei, LIU Caixia, et al. A collaborative caching strategy for privacy protection in content centric networking[J]. Journal of Electronics Information Technology, 2015, 37(5): 1220-1226. doi: 10.11999/ JEIT140874.

朱轶, 糜正琨, 王文鼐等. 一种基于内容流行度的内容中心网络缓存概率置换策略[J]. 电子与信息学报, 2013, 35(6): 1305-1310. doi: 10.3724/SP.J.1146.2012.01143.

ZHU Yi, MI Zhengkun, WANGg Wennai, et al. A cache probability replacement policy based on content popularity in content centric networks[J]. Journal of Electronics Information Technology, 2013, 35(6): 1305-1310. doi. 10.3724/SP.J1146.2012.01143.

MING Z X, XU M W, and WANG D. Age-based cooperative caching in information-centric networks[C]. IEEE INFOCOM Workshop on Emerging Design Choices in Name-oriented Networking, Orlando, USA, 2012: 268-273.

LEET D. On the existence of a spectrum of policies that subsumes the Least Recently Used (LRU) and Least Frequently Used (LFU) policies[C]. Proceedings of the 1999 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems, Atlanta, 1999: 134-143.

CHE H, TUNG Y, and WANG Z. Hierarchical Web caching systems: Modeling, design and experimental results[J]. IEEE Selected Areas in Communications, 2012, 20(7): 1305-1314.

TRAVERSO S, AHMED M, GATETTO M, et al. Temporal locality in today's content caching: Why it matters and how to model it[J]. ACM SIGCOMM Computer Communications Review, 2013, 43(5): 5-12.

KARYPIS G, HAN E H, and KUMAR V. CHAMELEON: Hierarchical clustering algorithm using dynamic modeling[J]. IEEE Computer, 1999, 32(8): 68-75.

AFANASYEV A, MOISEENKO I, and ZHANG L. ndnSIM: NDN Simulator for NS-3[R]. University of California Technical Report, 2012.

施引文献

资源附件(0)

访问统计

计量

文章访问数: 1517
HTML全文浏览量: 165
PDF下载量: 1001
被引次数: 0

姓名
邮箱
手机号码
标题
留言内容
验证码

留言板

基于内容流行度和节点中心度匹配的信息中心网络缓存策略

doi: 10.11999/JEIT150626

计量

Popularity and Centrality Based Selective Caching Scheme for Information-centric Networks

计量

目录

留言板

基于内容流行度和节点中心度匹配的信息中心网络缓存策略

doi: 10.11999/JEIT150626

计量

出版历程

Popularity and Centrality Based Selective Caching Scheme for Information-centric Networks

计量

出版历程

目录