基于节点动态内容流行度的缓存管理策略

doi:10.3969/j.issn.0372-2112.2016.11.020

电子学报 ›› 2016, Vol. 44 ›› Issue (11): 2704-2712.DOI: 10.3969/j.issn.0372-2112.2016.11.020

基于节点动态内容流行度的缓存管理策略

张果¹, 汪斌强¹, 张震¹, 梁超毅²

1. 国家数字交换系统工程技术研究中心, 河南郑州 450002;
2. 解放军信息工程大学, 河南郑州 450001

收稿日期:2015-04-16 修回日期:2016-01-07 出版日期:2016-11-25
- 通讯作者:
- 张果
- 作者简介:
- 汪斌强,男,1963年2月出生,安徽安庆人.国家数字交换系统工程技术研究中心教授、博士生导师,主要研究方向为宽带信息网络,网络安全.E-mail:wbq6301@163.com;张震,男,1985年出生,博士,讲师,研究方向为未来网络体系架构设计,网络测量;梁超毅,男,1978年出生,助教,研究方向为未来网络体系架构设计,内容中心网络.
- 基金资助:
- 国家自然科学基金创新研究群体项目 (No.61521003）; 国家973重点基础研究发展计划 (No.2012CB315901，No.2013CB329104）; 国家自然科学基金 (No.61372121，No.61309019，No.61309020，No.61572519）; 国家863高技术研究发展计划 (No.2015AA016102，No.2013AA013505）

A Strategy Based on Dynamical Content Popularity for Cache Management

ZHANG Guo¹, WANG Bin-qiang¹, ZHANG Zhen¹, LIANG Chao-yi²

1. National Digital Switching System Engineering & Technological R & D Center, Zhengzhou, Henan 450002, China;
2. PLA Information Engineering University, Zhengzhou, Henan 450001, China

Received:2015-04-16 Revised:2016-01-07 Online:2016-11-25 Published:2016-11-25
- Supported by:
- NSFC Innovation Research Group (No.61521003); National Key Basic Research Program of China (973 Program) (No.2012CB315901, No.2013CB329104); National Natural Science Foundation of China (No.61372121, No.61309019, No.61309020, No.61572519); National High-tech R&D Program of China (863 Program) (No.2015AA016102, No.2013AA013505)

摘要/Abstract

摘要：

针对命名数据网络中节点无法感知内容流行度变化的缺陷，提出了基于缓存内容流行度动态变化的内容管理策略.将缓存分为主缓存（Primary Cache，PC）和副缓存（Secondary Cache，SC），分别用于识别和保护流行内容；采用标准布鲁姆过滤器（Standard Bloom Filter，SBF）过滤流行内容请求；引入滑动时间窗口算法和HASH表对副缓存内容进行细粒度的统计分析，进而管理缓存内容.仿真显示，与现有算法相比，该策略以增加少量复杂度为代价，延长高流行度内容的缓存驻留时间，提高了缓存命中率，减轻了服务器负载，并具有可扩展性，具备单线路40Gbit/s的报文处理能力.

关键词: 命名数据网络, 动态内容流行度, 线速, 内容管理

Abstract:

To overcome the drawback that nodes in Named Data Networking are insensitive to the change of the content popularity,a dynamic content popularity based cache management strategy is proposed.The strategy divides the cache into primary and secondary one.The former is used to identify popular content and the latter is used to protect it.Standard Bloom Filter is adopted by the strategy to filter popular content requests.The strategy also introduces sliding window and hash table to analyze the content of secondary cache in fine granularity and manage the cache content.Simulation results show that,compared with traditional strategies,our algorithm prolongs the cache residence time of high popularity content,increases cache hit ratio and reduces server loads.Our algorithm is also scalable and has the ability to process packets at 40Gbit/s.

Key words: named data networking, dynamical content popularity, line speed, content management

中图分类号:

TP393

张果, 汪斌强, 张震, 等. 基于节点动态内容流行度的缓存管理策略[J]. 电子学报, 2016, 44(11): 2704-2712.

ZHANG Guo, WANG Bin-qiang, ZHANG Zhen, et al. A Strategy Based on Dynamical Content Popularity for Cache Management[J]. Acta Electronica Sinica, 2016, 44(11): 2704-2712.

参考文献

[1] Ahlgren B,Dannewitz C,Imbrenda C,et al..A survey of information-centric networking[J].IEEE Communication Magazine,2012,50(7):26-36.
[2] V Jacobson,D K Smetters,J D Thornton,M F Plass,N H Briggs,R L Braynard.Networking named content[A].Proceedings of the 5th international conference on Emerging networking experiments and technologies[C].NY,USA:2009.1-12.
[3] Wang J M,Zhang J,Bensaou B.Intra-AS cooperative caching for content-centric networks[A].Proceedings of the ACM SIGCOMM Workshop on Information-Centric Networking[C].Hong Kong,China:2013.61-66.
[4] Saino L,Psaras I,Pavlou G.Hash-routing schemes for information centric networking[A].Proceedings of the ACM SIGCOMM Workshop on Information-Centric Networking[C].Hong Kong,China:2013.27-32.
[5] S Podlipnig,L Boszormenyi.A survey of web cache replacement strategies[J].Acm Computing Surveys,2003,35(4):374-398.
[6] Jelenkovi'c P R,Radovanovi'c A.Least-recently-used caching with dependent requests[J].Theoretical Computer Science,2002,326(326):293-327.
[7] G Zhang,Y Li,T Lin.Caching in information centric networking:A survey[J].Computer Networks,2013,57(16):3128-3141.
[8] Ketan Shah,Anirban Mitra,Dhruv Matani.An O(1) algorithm for implementing the LFU cache eviction scheme[R/OL].http://dhruvbird.com/lfu.pdf.2010-08-16.
[9] K Katsaros,G Xylomenos,G C Polyzos.MultiCache:An overlay architecture for information-centric networking[J].Computer Networks,2011,55(4):936-947.
[10] 朱轶,糜正琨,王文鼐.一种基于内容流行度的内容中心网络缓存概率置换策略[J].电子与信息学报,2013,35(6):1305-1310. 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 and Information Technology,2013,35(6):1305-1310.(in Chinese)
[11] S J Kang,S W Lee,Y B Ko,A recent popularity based dynamic cache management for content centric networking[A].Proceedings of the International Conference on Ubiquitous & Future Networks[C].Phuket,Thailand:2012.219-224.
[12] S Traverso,M Ahmed,M Garetto,P Giaccone,E Leonardi,S Niccolini.Temporal locality in today's content caching:why it matters and how to model It[J].Acm Sigcomm Computer Communication Review,2013,43(5):5-12.
[13] G Rossini,D Rossi.Caching performance of content centric networks under multi-path routing (and more)[R/OL].http://perso.telecom-paristech.fr/~drossi/paper/rossi11ccn-techrep1.pdf.2015-04-15.
[14] D Perino and M Varvello.A reality check for content centric networking[A].Proceedings of the ACM SIGCOMM workshop on Information-centric networking[C].NY,USA:2011.44-49.
[15] 《现代应用数学手册》编委会.现代应用数学手册:概率统计与随机过程卷[M].北京:清华大学出版社,1999.74-75.
[16] A Broder,M Mitzenmacher.Network applications of bloom filters:A survey[J].Internet Mathematics,2003,1(4):485-509.
[17] S Mastorakis,A Afanasyev,I Moiseenko,L Zhang.NdnSIM 2.0:A new version of the NDN simulator for NS-3[R/OL].http://named-data.net/techreports.html.2015-01-27.
[18] Guo S,Xie H Y,Shi G.Collaborative forwarding and caching in content centric networks[A].Proceedings of the IFIP Networking[C].Prague,Czech Republic,2012.41-55.

基于节点动态内容流行度的缓存管理策略

A Strategy Based on Dynamical Content Popularity for Cache Management

PDF

可视化

摘要/Abstract

引用本文

使用本文

参考文献

相关文章 3

编辑推荐

Metrics

[1]	鄢欢, 高德云, 苏伟. 命名数据网络下基于K-medoids的簇内Hash路由机制[J]. 电子学报, 2017, 45(10): 2313-2322.
[2]	梁永生, 张基宏, 张乃通. IEEE标准容限内以太网转发时延的测试与分析[J]. 电子学报, 2008, 36(1): 46-50.
[3]	谭明锋, 龚正虎. 基于ASIC实现的高速可扩展并行IP路由查找算法[J]. 电子学报, 2005, 33(2): 209-213.