浏览全部资源
扫码关注微信
1. 中国科学院计算机网络信息中心,北京 100190
2. 中国科学院大学,北京 100049
[ "智江(1983-),男,山西太原人,中国科学院大学博士生,主要研究方向为下一代互联网关键技术、缓存技术。" ]
[ "李俊(1968-),男,安徽桐城人,中国科学院计算机网络信息中心副总工、博士生导师,主要研究方向为未来互联网、网络安全等。" ]
[ "吴海博(1981-),男,山东新泰人,博士,中国科学院计算机网络信息中心助理研究员,主要研究方向为未来互联网、缓存技术、对等网络。" ]
[ "任勇毛(1981-),男,湖南邵阳人,博士,中国科学院计算机网络信息中心副研究员,主要研究方向为未来互联网、传输协议、拥塞控制等。" ]
网络出版日期:2017-03,
纸质出版日期:2017-03-15
移动端阅览
智江, 李俊, 吴海博, 等. 基于边缘优先的ICN缓存协作策略[J]. 通信学报, 2017,38(3):53-64.
Jiang ZHI, Jun LI, Hai-bo WU, et al. Edge-first-based cooperative caching strategy in information centric networking[J]. Journal on communications, 2017, 38(3): 53-64.
智江, 李俊, 吴海博, 等. 基于边缘优先的ICN缓存协作策略[J]. 通信学报, 2017,38(3):53-64. DOI: 10.11959/j.issn.1000-436x.2017064.
Jiang ZHI, Jun LI, Hai-bo WU, et al. Edge-first-based cooperative caching strategy in information centric networking[J]. Journal on communications, 2017, 38(3): 53-64. DOI: 10.11959/j.issn.1000-436x.2017064.
针对信息中心网络(ICN)环境下缓存内容放置优化问题,提出一种边缘优先逐级反馈的缓存协作策略(ECCS)。该策略通过将缓存决策提前至请求转发阶段,将下游节点的缓存决策信息及内容统计信息逐级反馈给上游节点,以达到缓存信息即时更新、辅助上游节点完成协作缓存的目的。实验结果表明,ECCS 在服务负载减少率、平均跳数减少率和平均缓存命中率等方面与现有方法相比有显著优势。
In order to optimize the replica placement in information centric networking
an edge-first-based cooperative caching strategy (ECCS) was proposed.According to the strategy
cache decision was made during the interest forwarding stage.The decision result and statistic information would been forwarded to upstream routers step by step.Utilizing the information
upstream nodes could update their cache information table immediately to achieve cooperative caching.The experimental results indicate ECCS can achieve salient performance gain in terms of server load reduction ratio
average hop reduction ratio
average cache hit ratio
compared with current strategies.
ZHANG G , LI Y , LIN T . Caching in information centric networking:a surrey [J ] . Computer Networks the International Journal of Computer& Telecommunications Networking , 2013 , 57 ( 16 ): 3128 - 3141 .
JACOBSON V , SMETTERS D K , THORNTON J D , et al . Networking named content [C ] // The ACM CoNEXT . 2009 : 1 - 12 .
TEEMU K , MOHIT C , CHUN B G , et al . A data-oriented (and beyond) network architecture [J ] . ACM SIGCOMM Computer Communication Review , 2007 , 37 ( 4 ): 181 - 192 .
DANNEWITZ C , GOLIC J , OHLMAN B , et al . Secure naming for a network of information [C ] // The IEEE INFOCOM Workshops . 2010 : 1 - 6 .
NIKOS F , PEKKA N , DIRK T , et al . Developing information networking further:from PSIRP to PURSUIT [J ] . Broadband Communications,Networks and Systems , 2012 , 66 : 1 - 13 .
LAOUTARIS N , CHE H , STAVRAKAKIS I . The LCD interconnection of LRU caches and its analysis [J ] . Performance Evaluation , 2006 , 63 ( 7 ): 609 - 634 .
CHAI W K , HE D , PSARAS I , et al . Cache less for more in information-centric networks [C ] // The Networking 2012 . 2012 : 27 - 40 .
PSARAS I , CHAI W K , PAVLOU G . Probabilistic in-network caching for information-centric networks [C ] // The Second Edition of the ICN Workshop on Information-Centric Networking . 2012 : 55 - 60 .
葛国栋 , 郭云飞 , 兰巨龙 , 等 . CCN 中基于替换率的缓存空间动态借调机制 [J ] . 通信学报 , 2015 , 36 ( 5 ): 124 - 133 .
GE G D , GUO Y F , LAN J L , et al . Dynamic cache size transfer scheme based on replacement rate in content centric networking [J ] . Journal on Communications , 2015 , 36 ( 5 ): 124 - 133 .
WANG S , BI J , WU J , et al . Could in-network caching benefit information-centric networking [C ] // AINTEC . 2011 : 112 - 115 .
刘外喜 , 余顺争 , 胡晓 , 等 . 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 .
MING Z , XU M , WANG D . Age-based cooperative caching in information-centric networks [C ] // IEEE INFOCOM 2012 on Computer Communications Workshops . IEEE , 2012 : 268 - 273 .
CHO K , LEE M , PARK K , et al . WAVE:popularity-based and collaborative in-network caching for content-oriented networks [C ] // The IEEE INFOCOM Workshop on NOMEN . 2012 : 316 - 321 .
REN J , QI W , et al . MAGIC:a distributed max-gain in-network caching strategy in information-centric networks [C ] // Computer Communications Workshops (INFOCOM WKSHPS),2014 IEEE Conference . 2014 : 470 - 475 .
WU H , LI J , ZHI J . MBP:a max-benefit probability-based caching strategy in information-centric networking [C ] // IEEE International Conference on Communications . 2015 : 5646 - 5651 .
WANG L , HOQUE A , YI C A , et al . OSPFN:an OSPF based routing protocol for named data networking [R ] . University of Memphis and University of Arizona,Tech Rep , 2012 .
AKM M H , SYED O A , ADAM A , et al . NLSR:named-data link state routing protocol [C ] // The ACM SIGCOMM Workshop . 2013 : 15 - 20 .
AFANASYEV A , MOISEENKO I , ZHANG L . ndnSIM:NDN simulator for NS-3,NDN [R ] . Technical Report NDN-0005 , 2012 .
HENDERSON T R , et al . Ns-3 project goals [C ] // The 2006 Workshop on NS-2:the IP Network Simulator . 2006 .
BARAB A , ALBERT A R . Emergence of scaling in random networks [J ] . Science , 1999 , 286 ( 5439 ): 509 - 512 .
WATTS D J , STROGATZ S H . Collective dynamics of small world networks [J ] . Letters to Nature , 1998 , 393 : 440 - 442 .
LEE B , PEI C , LI F , et al . Web caching and Zipf-like distributions:evidence and implications [C ] // The IEEE INFOCOM . 1999 : 126 - 134 .
0
浏览量
857
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构