基于节点社团重要度的ICN缓存策略

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

摘要/Abstract

摘要：

全网内置缓存是 ICN(信息中心网络)架构中最重要的特性之一。为使被缓存的内容对象在空间和时间上分布更合理，提出了一种基于节点社团重要度的缓存策略（CSNIC）。该策略以社团为单位，不仅把内容缓存到社团内用户容易获取的节点处，而且使不同流行度的内容对象在各社团内节点处的时间分布上更合理。在多种实验条件下对CSNIC策略进行了仿真验证，结果表明该策略与CEE-LRU、Betw-LFU、Opportunistic相比，能更好地提升包括缓存命中率、跳数减少率、内容差异性及替换数量等在内的网络缓存性能指标，而且，CSNIC策略的额外开销较小。

关键词: 信息中心网络, 缓存, 替换, 节点社团重要度

Abstract:

In-network caching is one of the most important features of ICN (information-centric networks).A caching strategy based on node’s importance to community was proposed to make content objects cached more reasonable in temporal and spatial distribution.Within each community,the strategy not only caches content objects in those nodes where users are easy to access the content,but also makes different popularity of content objects more reasonable in temporal distribution.The CSNIC strategy was implemented under a variety of experimental conditions,and compare it with the previous strategies CEE-LRU,Betw-LFU and Opportunistic.The simulation results show that the strategy can yield a significant performance improvement,such as,cache hit ratio,hop reduction ratio,content diversity ratio and number of replacement.Furthermore,the additional overhead of CSNIC is small.

Key words: information-centric networks, cache, replacement policy, node’s importance to community

蔡君,余顺争,刘外喜. 基于节点社团重要度的ICN缓存策略[J]. 通信学报, 2015, 36(6): 173-182.

Jun CAI,Shun-zheng YU,Wai-xi LIU. Caching strategy based on node’s importance to community in information-centric networks[J]. Journal on Communications, 2015, 36(6): 173-182.

图/表 15

图1

图2

图3

图4

表1

图5

图6

图7

图8

图9

图10

图11

图12

图13

图14

参考文献 26

[1]	MOHIT C,BYUNG-GON C , ANDREY E , et al . A data-oriented (and beyond) network architecture[A]. Proceedings of the 2007 Conference on Applications,Technologies,Architectures,and Protocols for Computer Communications[C]. 2007. 181-192.
[2]	VAN J , DIANA K , JAMES D . Networking named content[A]. CoNEXT '09 Proceedings of the 5th International Conference on Emerging Networking Experiments and Technologies[C]. 2009. 1-12.
[3]	Conceptual architecture:principles,patterns and sub-components descriptions[EB/OL].,2011.
[4]	WEI K C . Curling:content-ubiquitous resolution and delivery infrastructure for next-generation services[J]. IEEE Communications Magazine, 2011,49(3): 112-120.
[5]	FP7/NICT GreenICN project[EB/OL]..
[6]	GHODSI A , SHENKER S , KOPONEN T ,et al. Information-centric networking:seeing the forest for the trees[A]. HotNets-X Proceedings of the 10th ACM Workshop on Hot Topics in Networks[C]. 2011. 1-6.
[7]	CHAI W , HE D , PSARAS I ,et al. Cache less for more in information-centric networks(extended version)[J]. Computer Communications, 2013,36(7): 758-770.
[8]	黄韬, 刘江, 霍如等 . 未来网络体系架构研究综述[J]. 通信学报, 2014,35(8): 184-197. HUANG T , LIU J , HUO R ,et al. Survey of research on future network architectures[J]. Journal on Communications, 2014,35(8): 184-197.
[9]	张国强, 李杨, 林涛等 . 信息中心网络中的内置缓存技术研究[J]. 软件学报, 2014,25(1): 154-175. ZHANG G Q , LI Y , LIN T ,et al. Survey of in-network caching techniques in information-centric networks[J]. Journal of Software, 2014,25(1): 154-175.
[10]	GHODSI A , SHENKER S , KOPONEN T ,et al. Information-centric networking:seeing the forest for the trees[A]. HotNets-X Proceedings of the 10th ACM Workshop on Hot Topics in Networks[C]. 2011. 1-6.
[11]	EUM S , NAKAUCHI K , MURATA M ,et al. CATT:potential based routing with content caching for ICN[A]. Proceedings of the Second Edition of the ICN Workshop on Information-Centric Networking[C]. 2012. 49-54.
[12]	SAINO L , PSARAS I , PAVLOU G . Hashing routing scheme for information-centric networking[A]. Pro of the 3rd ACM SIGCOMM Workshop on Information-Centric Networking[C]. 2013. 27-32.
[13]	HE Y , ZHU Y , SHI J ,et al. A cache strategy in content-centric networks based on node’s importance[J]. Information Technology Journal, 2014,13(3): 588-592.
[14]	HU X , GONG J . Opportunistic on-path caching for named data networking[J]. IEICE Transactions on Communications, 2014,97(11): 2360-2367.
[15]	刘外喜, 余顺争, 胡晓等 . 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.
[16]	ERIKSEN K A , SIMONSEN I , MASLOV S ,et al. Modularity and extreme edges of the Internet[J]. Physical Review Letters, 2003,90(14): 148701-148704.
[17]	ZHANG G Q , LI Y , LIN T . Caching in information centric networking:a survey[J]. Computer Networks, 2013,57(16): 3128-3141.
[18]	PODLIPNIG S,B?SZ?RMENYI L . A survey of Web cache replacement strategies[J]. ACM Computing Surveys, 2003,35(4): 374-398.
[19]	CHAUHAN S , GIRVAN M , OTT E . Spectral properties of networks with community structure[J]. Physical Review, 2009,80(5): 56-114.
[20]	WANG Y , DI Z R , FAN Y . Identifying and characterizing nodes important to community structure using the spectrum of the graph[J]. PLos ONE, 2011,6(11): 1-10.
[21]	蔡君, 余顺争 . 一种有效提高无标度网络负载容量的管理策略[J]. 物理学报, 2013,62(5): 058-901. CAI J , YU S Z . An efficient management strategy for enhancing traffic capacity in scale-free networks[J]. Acta Physica Sinica, 2013,62(5):058901.
[22]	CALVERT K I , DOAR M B , ZEGURA E W . Modeling Internet topology[J]. Communications Magazine,IEEE, 1997,35(6): 160-163.
[23]	NEWMAN M E J , GIRVAN M . Finding and evaluating community structure in networks[J]. Physical Review E, 2004,69(2):26113.
[24]	BRESLAU L , CAO P , FAN L ,et al. Web caching and zipf-like distributions:evidence and implications[A]. IEEE INFOCOM[C]. 1999. 126-134.
[25]	YAN G , FU Z Q , REN J ,et al. Collective synchronization induced by epidemic dynamics on complex networks with communities[J]. Physical Review E, 2007,75(1):16108.
[26]	NEWMAN M . Networks:an Introduction[M]. Oxford University Press,Inc, 2010.

Cache	CSNIC	CEE+LFU	Betw+LRU	Opportunistic
10	0.003 28	1	0.002 93	0.003 31
20	0.003 20	1	0.002 81	0.003 26
40	0.002 97	1	0.002 72	0.002 89
80	0.002 90	1	0.002 59	0.002 86
160	0.002 83	1	0.002 51	0.002 78
320	0.002 76	1	0.002 40	0.002 73