基于CCN节点内容流行规律的缓存路由策略
|
摘要
针对内容中心网络(CCN)中缓存路由策略的缓存可用性差、路径外缓存难以有效利用的问题,提出了一种动态缓存通告及节点内容流行规律的缓存路由策略.依据不同节点内容流行度进行差异化动态缓存通告,利用缓存通告信息及节点内容流行规律依概率进行缓存决策,增加高流行度内容的缓存概率及临近缓存的差异性;基于缓存通告信息建立局部吸引势场,并结合内容源建立全网吸引势场,实现内容请求的就近响应.仿真结果表明,在保证存储开销和传输开销的前提下,本策略可有效降低平均请求时延,提高缓存命中率.
Aiming at the problem of poor cache usability and difficulty of using off path cache in the existing caching and routing strategies in Content Centric Networking(CCN), a Caching and Routing Strategy based on dynamic caching notification and regularity of regional content popularity is proposed. Dynamic differential cache notification is carried out for the nodes with different node content popularity, cache decision is carried out based on probability in adjustment of cache notification information and regularity of regional content popularity,increasing the cache probability of high popularity content and the difference of adjacent cache; The local attraction potential field is established by using the cache information, and the whole network attraction potential field is established by the content source, routing selections are based on the attraction potential field, realizing the nearest response to content request. Simulation results show that this strategy can reduce the average request delay,increase the cache hit ratio, improving the network transmission performance with a small amount of storage and transmission overhead.
Aiming at the problem of poor cache usability and difficulty of using off path cache in the existing caching and routing strategies in Content Centric Networking(CCN), a Caching and Routing Strategy based on dynamic caching notification and regularity of regional content popularity is proposed. Dynamic differential cache notification is carried out for the nodes with different node content popularity, cache decision is carried out based on probability in adjustment of cache notification information and regularity of regional content popularity,increasing the cache probability of high popularity content and the difference of adjacent cache; The local attraction potential field is established by using the cache information, and the whole network attraction potential field is established by the content source, routing selections are based on the attraction potential field, realizing the nearest response to content request. Simulation results show that this strategy can reduce the average request delay,increase the cache hit ratio, improving the network transmission performance with a small amount of storage and transmission overhead.
引文
[1]Xylomenos G, Ververidis C N, Siris V A, et al. A survey of information-centric networking research[J]. IEEE Communications Surveys&Tutorials, 2014, 16(2):1024-1049.
[2]Jacobson V, Smetters D K, Thornton J D, et al. Networking named content[C]. In:Proc. of the 5th Int'l Conf. on Emerging Networking Experiments and Technologies(CoNEXT 2009). New York, ACM, 2009:1-12.
[3]Jelenkovic P,Radovanovic A,Squillante M S. Critical sizing of lru caches with dependent requests[J]. Journal of Applied Probability, 2006, 43(2):1013-1027.
[4]张国强,李杨,林涛,等.信息中心网络中的内置缓存技术研究[J].软件学报,2014, 25(1):15-175.
[5]Laoutaris N, Che H,Stavrakakis I. The LCD interconnection of LRU caches and its analysis[J].Performance Evaluation, 2006, 63(5):609-634.
[6]Chai W, HE D,Ioannis P, et al. Cache “Less for More” in information-centric networks(extended version)[J]. Computer Communications, 2013, 36(5):758-770.
[7]张果,胡宇翔,黄万伟.基于流行内容感知和跟踪的缓存策略[J].通信学报,2017, 38(2):132-142.
[8]Eum S, Nakauchi K, Murata M, et al. CATT:Potential based routing with content caching for ICN[C]. In:Proc. of the 2nd ICN Workshop on Information-Centric Networking. 2012:49-54.
[9]Shanbhag S, Schwan N, Rimac I,et al. SoCCeR:services over content-centric routing[C]. Proceedings of the ACM SIGCOMM Workshop on Information-Centric Networking, Toronto, Canada,2011:62-67.
[10]Yuemei XU, Yang LI, Tao LIN, et al. A Dominating-set-based Collaborative Caching with Request Routing in Content Centric Networking[C]. IEEE International Conference on Communications(ICC), 2013:3624-3628.
[11]葛国栋,郭云飞,刘彩霞.内容中心网络中基于差异化缓存通告的混合路由机制[J].电子与信息学报,2015, 37(1):700-707.
[12]童彤.内容中心网络缓存管理及配置方法研究[D].电子科技大学,2015.
[13]刘外喜,余顺争,胡晓.CCN中选择性缓存机制的研究[J].计算机学报,2014,37(2):275-288.
[14]Yang J, Leskoves J. Patterns of temporal variation in online media[C]. In Proc. of the 4th ACM International Conference on Web Search and Data Mining. Hong Kong, China, 2011:177-186.
[15]Szabo G, Huberman B A. Predicting the popularity of online content. Communications of the ACM, 2010, 53(8):80-88.
[16]S. E, K. N, M. Murata, et al. Potential based routing as a secondary best-effort routing for Information Centric Networking(ICN)[J]. Computer Networks, 2013, 57(16):3154-3164.
[17]S Mastorakis, A Afanasyey, I Moiseenko, L Z. Ndn-SIM 2.0:a new version of the NDN simulator for NS-3[R/OL]. http://named-data.net/techreports.html.2015-01-27.
[18]葛国栋,郭云飞,刘彩霞.内容中心网络中面向隐私保护的协作缓存策略[J].电子与信息学报,2015,37(3):1220-1226.
[2]Jacobson V, Smetters D K, Thornton J D, et al. Networking named content[C]. In:Proc. of the 5th Int'l Conf. on Emerging Networking Experiments and Technologies(CoNEXT 2009). New York, ACM, 2009:1-12.
[3]Jelenkovic P,Radovanovic A,Squillante M S. Critical sizing of lru caches with dependent requests[J]. Journal of Applied Probability, 2006, 43(2):1013-1027.
[4]张国强,李杨,林涛,等.信息中心网络中的内置缓存技术研究[J].软件学报,2014, 25(1):15-175.
[5]Laoutaris N, Che H,Stavrakakis I. The LCD interconnection of LRU caches and its analysis[J].Performance Evaluation, 2006, 63(5):609-634.
[6]Chai W, HE D,Ioannis P, et al. Cache “Less for More” in information-centric networks(extended version)[J]. Computer Communications, 2013, 36(5):758-770.
[7]张果,胡宇翔,黄万伟.基于流行内容感知和跟踪的缓存策略[J].通信学报,2017, 38(2):132-142.
[8]Eum S, Nakauchi K, Murata M, et al. CATT:Potential based routing with content caching for ICN[C]. In:Proc. of the 2nd ICN Workshop on Information-Centric Networking. 2012:49-54.
[9]Shanbhag S, Schwan N, Rimac I,et al. SoCCeR:services over content-centric routing[C]. Proceedings of the ACM SIGCOMM Workshop on Information-Centric Networking, Toronto, Canada,2011:62-67.
[10]Yuemei XU, Yang LI, Tao LIN, et al. A Dominating-set-based Collaborative Caching with Request Routing in Content Centric Networking[C]. IEEE International Conference on Communications(ICC), 2013:3624-3628.
[11]葛国栋,郭云飞,刘彩霞.内容中心网络中基于差异化缓存通告的混合路由机制[J].电子与信息学报,2015, 37(1):700-707.
[12]童彤.内容中心网络缓存管理及配置方法研究[D].电子科技大学,2015.
[13]刘外喜,余顺争,胡晓.CCN中选择性缓存机制的研究[J].计算机学报,2014,37(2):275-288.
[14]Yang J, Leskoves J. Patterns of temporal variation in online media[C]. In Proc. of the 4th ACM International Conference on Web Search and Data Mining. Hong Kong, China, 2011:177-186.
[15]Szabo G, Huberman B A. Predicting the popularity of online content. Communications of the ACM, 2010, 53(8):80-88.
[16]S. E, K. N, M. Murata, et al. Potential based routing as a secondary best-effort routing for Information Centric Networking(ICN)[J]. Computer Networks, 2013, 57(16):3154-3164.
[17]S Mastorakis, A Afanasyey, I Moiseenko, L Z. Ndn-SIM 2.0:a new version of the NDN simulator for NS-3[R/OL]. http://named-data.net/techreports.html.2015-01-27.
[18]葛国栋,郭云飞,刘彩霞.内容中心网络中面向隐私保护的协作缓存策略[J].电子与信息学报,2015,37(3):1220-1226.