基于收益感知的信息中心网络缓存机制

doi:10.11959/j.issn.1000-436x.2016101

摘要/Abstract

摘要：

针对信息中心网络（ICN）内置缓存系统中的海量内容块流行度获取和存储资源高效利用问题，以最大化节省内容访问总代价为目标，建立针对内容块流行度的缓存收益优化模型，提出了一种基于收益感知的缓存机制。该机制利用缓存对请求流的过滤效应，在最大化单点缓存收益的同时潜在地实现节点间协作和多样化缓存；使用基于布隆过滤器的滑动窗口策略，在检测请求到达间隔时间的同时兼顾从源服务器获取内容的代价，捕获缓存收益高的内容块。分析表明，该方法能够大幅压缩获取内容流行度的存储空间开销；仿真结果表明，该方法能够较为准确地实现基于流行度的缓存收益感知，且在内容流行度动态变化的情况下，在带宽节省和缓存命中率方面更具优势。

关键词: 信息中心网络, 内容路由, 缓存机制, 内容流行度

Abstract:

The in-network caching system of information-centric networking had to deal with the popularity of huge number of content chunks and make efficient usage of storage resources.A content popularity based caching gain opti-mization model aimed to get maximum reduction of content retrieve cost was established,and a gain-aware caching scheme was proposed.By utilizing filtering effect of cache to request flow is scheme achieves caching cooperation and diversity potentially while maximizing caching gain of every single node.Bloom filter based sliding window strategy captures the content chunks with high caching gain according to request arrival interval and retrieval cost from the source.Analysis shows that the method can drastically reduce memory consumption caused by popularity monitoring.The simu-lation results illuminate that this scheme is well aware of content popularity based caching gain,and gets better band-width saving and cache hit ratio when content popularity is changing dynamically.

Key words: information-centric networking, content-based routing, caching scheme, content popularity

陈龙,汤红波,罗兴国,柏溢,张震. 基于收益感知的信息中心网络缓存机制[J]. 通信学报, 2016, 37(5): 130-142.

Long CHEN,Hong-bo TANG,Xing-guo LUO,Yi BAI,Zhen ZHANG. Gain-aware caching scheme for information-centric networking[J]. Journal on Communications, 2016, 37(5): 130-142.

图/表 11

表1

表2

符号说明"

符号	含义
N	缓存节点集合
S	内容源服务器集合
K	网络中的内容块集合
$g_{n}^{k}$	节点n上内容块k的外生请求到达率
$l_{n}^{k}$	节点n上内容块k的请求到达率
l_n	节点n上内容请求总到达率
$h_{s_{i}}^{k}$	时隙s_i中内容块k的命中次数
$d_{n}^{k}$	缓存节点n上是否存储有内容块k
s(k)	内容块k的源服务器
$c_{n}^{k}$	节点n从s(k)获取内容块k所产生的代价
v_n	节点n能够缓存内容块的数量
K_n	节点n缓存内容块的集合

表2

图1

图2

图3

图4

图5

图6

图7

图8

图9

参考文献 29

[1]	XYLOMENOS G , VERVERIDIS C N , SIRIS V A , et al. A surve of information-centric networking research[J]. Communications Surveys& Tutorials, 2014,16(2): 1024-1049.
[2]	张国强, 李杨, 林涛 , 等. 信息中心网络中的内置缓存技术研究[J]．软件学报, 2014,25(1): 154-175. ZHANG G Q , LI Y , LIN T , et al. Survey of in-network caching tech-niques in information-centric networks[J]. Journal of Software, 2014,25(1): 154-175.
[3]	JACOBSON V , SMETTERS D K , THORNTON J D , et al. Network-ing named content[J]. Communications of the ACM, 2012,55(1): 117-124.
[4]	BORST S , GUPTA V , WALID A . Distributed caching algorithms for content distribution networks[C]// The IEEE INFOCOM. San Diego,CA c2010: 1-9.
[5]	SAINO L , PSARAS I , PAVLOU G . Hashing routing schemes for information-centric networking[C]// The 3rd ACM SIGCOMM Work-shop on Information-Centric Networking. New York,USA c2013: 27-32.
[6]	葛国栋, 郭云飞, 刘彩霞 , 等. 命名数据网络中基于局部请求相似性的协作缓存路由机制[J]．电子与信息学报, 2015,37(2): 435-442. GE G D , GUO Y F , LIU C X , et al. Collaborative caching and routing scheme based on local request similarity in named data networking[J]. Journal of Electronics & Information Technology, 2015,37(2): 435-442.
[7]	LAOUTARIS N , SYNTILA S , STAVRAKAKIS I . Meta algorithms for hierarchical Web caches[C]// 2004 IEEE International Conference on Performance,Computing,and Communications. Phoenix,USA, C2004: 445-452.
[8]	EUM S , NAKAUCHI K , MURATA M , et al. CATT:potential based routing with content caching for ICN[C]// ACM SIGCOMM Workshop on Information-Centric Networking. Helsinki,Finland, C2012: 49-54.
[9]	PSARAS I , CHAI W K , PAVLOU G . Probabilistic in-network caching for information-centric networks[C]// ACM SIGCOMM Workshop on Information-Centric Networking. Helsinki,Finland, C2012: 55-60.
[10]	PSARAS I , WEI K C , PAVLOU G . In-network cache management and resource allocation for information-centric networks[J]. Parallel and Distributed Systems,IEEE Transactions on, 2014,25(11): 2920-2931.
[11]	KIDEOK C , MUNYOUNG L , KUNWOO P , et al. WAVE:populari-ty-based and collaborative in-network caching for content-oriented networks[C]// 2012 IEEE Conference on Computer Communications Workshops(INFOCOM WKSHPS). Orlando,FL, C2012: 316-321.
[12]	CHAI W , HE D , PSARAS I , et al. Cache less for more in informa-tion-centric networks(extended version)[J]. Computer Communica-tions. 2013,36(7): 758-770.
[13]	蔡君, 余顺争, 刘外喜 . 基于节点社团重要度的ICN缓存策略[J]．通信学报, 2015,36(6): 2015222. CAI J , YU S Z , LIU W X , et al. Caching strategy based on node's impor-tance to community in information-centric networks[J]. Journal on Communications, 2015,36(6): 2015222.
[14]	MING Z X , XU M W , WANG D . Age-based cooperative caching in information-centric networks[C]// 2012 IEEE INFOCOM Workshop on Emerging Design Choices in Name-Oriented Networking. Orlando,USA, c2012: 268-273.
[15]	IOANNOU A , WEBER S . Towards on-path caching alternatives in information-centric networks[C]// 2014 IEEE 39th Conference on Lo-cal Computer Networks(LCN). Edmonton,AB, C2014: 362-365.
[16]	刘外喜, 余顺争, 胡晓 , 等. CCN中选择性缓存机制的研究[J]．计算机学报, 2014,37(2): 275-288. LIU W X , YU S Z , HU X , et al. Selective caching in content-centric networking[J]. Chinese Journal of Computers, 2014,37(2): 275-288.
[17]	JING R , WEN Q , WESTPHAL C , et al. MAGIC:a distributed max-gain in-network caching strategy in information-centric net-works[C]. 2014 IEEE Conference on Computer Communications Workshops(INFOCOM WKSHPS). Toronto,ON, C2014: 470-475.
[18]	BADOV M , SEETHARAM A , KUROSE J , et al. Congestion-aware caching and search in information-centric networks[C]// The 1st Inter-national Conference on Information-Centric Networking. Paris,France, C2014: 37-46.
[19]	MELAZZI N B , BIANCHI G , CAPONI A , et al. A general,tractable and accurate model for a cascade of LRU caches[J]. Com unications Letters,IEEE, 2014,18(5): 877-880.
[20]	DAI H , WANG Y , WU H , et al. Towards line-speed and accurate on-line popularity monitoring on NDN routers[C]// 2014 IEEE 22nd International Symposium of Quality of Service(IWQoS). Hong Kong,China, c2014: 178-187.
[21]	KIM Y , YEOM I . Performance analysis of in-network caching for content-centric networking[J]. Computer Networks, 2013,57(13): 2465-2482.
[22]	朱轶, 糜正琨, 王文鼐 . 一种基于内容流行度的内容中心网络缓存概率置换策略[J]．电子与信息学报, 2013,35(06): 1305-1310. ZHU Y , MI Z K , WANG W N . A cache probability replacement policy based on content popularity in content centric networks[J]. Journal of Electronics & Information Technology, 2013,35(6): 1305-1310.
[23]	YEH E , HO T , CUI Y , et al. VIP:a framework for joint namic for-warding and caching in named data networks[C]// The 1st International Conference on Information-Centric Networking. Paris,France, C2014: 117-126.
[24]	BRESLAU L , CAO P , FAN L , et al. Web caching and Zipf like distri-butions:evidence and Implications[C]// IEEE International Conference on Computer Communications(INFOCOM). NewYork,USA, c1999: 126-134.
[25]	TARKOMA S , ROTHENBERG C E . LAGERSPETZ E.Theory and practice of Bloom filters for distributed systems[J]. IEEE Communica-tions Surveys & Tutorials, 2012,14(1): 131-155.
[26]	AFANASYEV A , MOISEENKO I , ZHANG L X . ndnSIM:NDN simulator for NS-3[R]. NDN,Technical Report NDN-0005. 2012.
[27]	NS-3 based named data networking(NDN)simulator[EB/OL]. , 2014.
[28]	SPRING N , MAHAJAN R , WETHERALL D , et al. Measuring ISP topologies with rocketfuel[J]. IEEE/ACM Transactions on Networking, 2004,12(1): 2-16.
[29]	GUO S , XIE H Y , SHI G . Collaborative forwarding and caching in content centric networks[C]// IFIP Networking.Prague,Czech Repub-lic, c2012: 41-55.