基于内容流行度和节点重要度的CCN缓存策略
|
摘要
内容中心网络(content centric network,CCN)强调以内容资源本身为中心,CCN网络在路由节点对内容进行缓存,使内容接近用户,因而缓存策略研究成为CCN网络的关键技术之一。传统的主流缓存策略Always(处处缓存)、LCD(leave copy down)都会很大程度上造成节点空间的浪费和缓存内容的冗余。改进的Betw(betweenness)方案仅考虑了节点介数,容易造成两个问题:一是导致最流行的内容只缓存在高介数的节点,无法到达最靠近用户的位置;二是导致高介数的节点缓存更换频繁,流行内容缓存时间短。为了解决这一问题,提出一种内容流行度与节点重要度相结合的缓存机制,实现优化的缓存协作。在ndnSIM平台进行仿真,结果表明该方案提高了路由节点缓存命中率,减小了获取内容的平均跳数。
Content center network( CCN) emphasizes the content resource itself as the center.CCN network caches the content in the routing node in order to make the content close to the user,so the cache scheme research has become one of the key technologies of CCN network.The traditional mainstream cache strategy like Always( always cached),LCD( leave copy down) will be largely caused by the waste of node space and the redundancy of content.The improved scheme Betwonly takes into account the betweenness,which can lead to two main problems: one is that the most popular content is only cached in the node with the lager betweenness,which can not reach the nearest user position; the other is that the Betwhas the more frequent replacement,which will decrease the time of the content cache in node.For this,we propose a coporate caching scheme considering content popularity and betweenness to realize optimized cache cooperation.The simulation on the ndn SIMplatform shows that the proposed scheme improves the hit rate of the routing node and reduces the average hop count for getting the content.
Content center network( CCN) emphasizes the content resource itself as the center.CCN network caches the content in the routing node in order to make the content close to the user,so the cache scheme research has become one of the key technologies of CCN network.The traditional mainstream cache strategy like Always( always cached),LCD( leave copy down) will be largely caused by the waste of node space and the redundancy of content.The improved scheme Betwonly takes into account the betweenness,which can lead to two main problems: one is that the most popular content is only cached in the node with the lager betweenness,which can not reach the nearest user position; the other is that the Betwhas the more frequent replacement,which will decrease the time of the content cache in node.For this,we propose a coporate caching scheme considering content popularity and betweenness to realize optimized cache cooperation.The simulation on the ndn SIMplatform shows that the proposed scheme improves the hit rate of the routing node and reduces the average hop count for getting the content.
引文
[1]崔现东,刘江,黄韬,等.基于节点介数和替换率的内容中心网络网内缓存策略[J].电子与信息学报,2014,36(1):1-7.
[2]LI Yang,LIN Tao,TANG Hui,et al.A chunk caching location and searching scheme in content centric netw orking[C]//IEEE international conference on communications.Ottaw a,ON,Canada:IEEE,2012:2655-2659.
[3]朱轶,糜正琨,王文鼐.一种基于内容流行度的内容中心网络缓存概率置换策略[J].电子与信息学报,2013,35(6):1305-1310.
[4]TARNOI S,SUKSOMBOON K,KUMWILAISAK W,et al.Performance of probabilistic caching and cache replacement policies for content-centric netw orks[C]//39th annual IEEE conference on local computer netw ork.[s.l.]:IEEE,2014.
[5]林闯,贾子骁,孟坤.自适应的未来网络体系架构[J].计算机学报,2012,35(6):1077-1093.
[6]王国卿,黄韬,刘江,等.一种基于逗留时间的新型内容中心网络缓存策略[J].计算机学报,2015,38(3):472-482.
[7]芮兰兰,彭昊,黄豪球,等.基于内容流行度和节点中心度匹配的信息中心网络缓存策略[J].电子与信息学报,2016,38(2):325-331.
[8]曾宇晶,靳明双,罗洪斌.基于内容分块流行度分级的信息中心网络缓存策略[J].电子学报,2016,44(2):358-364.
[9]徐昌彪,王华.CCN中基于内容流行度和节点重要度的缓存设计[J].电子应用技术,2017,43(3):100-103.
[10]曲桦,王伟萍,赵季红.内容中心网络中一种改进型缓存机制[J].计算机工程,2015,41(3):41-46.
[11]CUI Yufei,ZHAO Min,WU Muqing.A centralized control caching strategy based on popularity and betw eenness centrality in CCN[C]//IEEE conference on international symposium on w ireless communication systems.Poznan,Poland:IEEE,2016:286-291.
[12]CHAI W K,HE Diliang,IOANNIS P,et al.Cache“less for more”in information-centric netw orks(extended version)[J].Computer Communications,2013,36(7):758-770.
[13]董美姣.基于内容流行度预测的内容中心网络缓存技术研究[D].北京:北京邮电大学,2015.
[14]GUAN Jianfeng,HE Yunhang,WEI Quan,et al.A classification-based w isdom caching scheme for content centric netw orking[C]//IEEE conference on computer communications w orkshops.San Francisco,CA,USA:IEEE,2016.
[2]LI Yang,LIN Tao,TANG Hui,et al.A chunk caching location and searching scheme in content centric netw orking[C]//IEEE international conference on communications.Ottaw a,ON,Canada:IEEE,2012:2655-2659.
[3]朱轶,糜正琨,王文鼐.一种基于内容流行度的内容中心网络缓存概率置换策略[J].电子与信息学报,2013,35(6):1305-1310.
[4]TARNOI S,SUKSOMBOON K,KUMWILAISAK W,et al.Performance of probabilistic caching and cache replacement policies for content-centric netw orks[C]//39th annual IEEE conference on local computer netw ork.[s.l.]:IEEE,2014.
[5]林闯,贾子骁,孟坤.自适应的未来网络体系架构[J].计算机学报,2012,35(6):1077-1093.
[6]王国卿,黄韬,刘江,等.一种基于逗留时间的新型内容中心网络缓存策略[J].计算机学报,2015,38(3):472-482.
[7]芮兰兰,彭昊,黄豪球,等.基于内容流行度和节点中心度匹配的信息中心网络缓存策略[J].电子与信息学报,2016,38(2):325-331.
[8]曾宇晶,靳明双,罗洪斌.基于内容分块流行度分级的信息中心网络缓存策略[J].电子学报,2016,44(2):358-364.
[9]徐昌彪,王华.CCN中基于内容流行度和节点重要度的缓存设计[J].电子应用技术,2017,43(3):100-103.
[10]曲桦,王伟萍,赵季红.内容中心网络中一种改进型缓存机制[J].计算机工程,2015,41(3):41-46.
[11]CUI Yufei,ZHAO Min,WU Muqing.A centralized control caching strategy based on popularity and betw eenness centrality in CCN[C]//IEEE conference on international symposium on w ireless communication systems.Poznan,Poland:IEEE,2016:286-291.
[12]CHAI W K,HE Diliang,IOANNIS P,et al.Cache“less for more”in information-centric netw orks(extended version)[J].Computer Communications,2013,36(7):758-770.
[13]董美姣.基于内容流行度预测的内容中心网络缓存技术研究[D].北京:北京邮电大学,2015.
[14]GUAN Jianfeng,HE Yunhang,WEI Quan,et al.A classification-based w isdom caching scheme for content centric netw orking[C]//IEEE conference on computer communications w orkshops.San Francisco,CA,USA:IEEE,2016.