基于动态流行度与请求代价的命名数据网络缓存策略

计算机工程

基于动态流行度与请求代价的命名数据网络缓存策略

郭晨,郑烇,丁尧,王嵩

(中国科学技术大学自动化系未来网络实验室,合肥 230026)

收稿日期:2017-01-25 出版日期:2018-02-15 发布日期:2018-02-15
作者简介:郭晨(1992—),男,硕士研究生,主研方向为计算机体系结构、未来网缓存技术;郑烇(通信作者),副教授;丁尧,硕士研究生;王嵩,讲师。
基金资助:
国家自然科学基金重点项目“三网融合业务接入系统的分析、建模与调控”(61233003)。

Cache Strategy Based on Dynamic Popularity and Request Cost in Named Data Networking

GUO Chen,ZHENG Quan,DING Yao,WANG Song

(Laboratory for Future Networks,Department of Automation,University of Science and Technology of China,Hefei 230026,China)

Received:2017-01-25 Online:2018-02-15 Published:2018-02-15

摘要/Abstract

摘要： 为实现高效的命名数据网络(NDN)缓存替换,设计动态流行度与请求代价相结合的缓存替换策略。使每个节点单独计算缓存内容的动态流行度与请求代价的加权(DPC)值,并基于该值进行缓存内容的替换,保留高流行度与高请求代价的内容。在此基础上,根据内容的DPC值对其分类,执行区分化的缓存决策算法,合理选择节点放置缓存。实验结果表明,相对于典型NDN缓存策略,该策略能有效提高缓存命中率,降低平均跳数。

关键词: 命名数据网络, 动态流行度, 请求代价, 缓存替换, 缓存决策

Abstract: In order to replacing cache efficiently in Named Data Networking(NDN),a cache replacement strategy combining dynamic popularity and cost cache replacement policy is proposed in this paper,which named DPCP.Each node calculates the Dynamic Popularity and Cost(DPC) value of every cache content in its content store.It replaces cache based on the DPC value of content store’s cache content,so as to keep content with high popularity and request cost.Furthermore,it divides contents into different types based on the DPC value and executes Differentiated Decision Policy(DDP) to choose cache node.Experimental results show that the proposed strategy can achieve higher cache hit ratio and reduce average request hop,compared with classical NDN cache algorithm.

Key words: Named Data Networking(NDN), dynamic popularity;request cost, cache replacement, cache decision

中图分类号:

TP393

郭晨,郑烇,丁尧,王嵩. 基于动态流行度与请求代价的命名数据网络缓存策略[J]. 计算机工程.

GUO Chen,ZHENG Quan,DING Yao,WANG Song. Cache Strategy Based on Dynamic Popularity and Request Cost in Named Data Networking[J]. Computer Engineering.

参考文献

参考文献［1］张国强,李杨,林涛,等.信息中心网络中的内置缓存技术研究［J］.软件学报,2014,25(1):154-175. ［2］ZHANG L,ESTRIN D,BURKE J,et al.Named Data Networking (NDN) Project:NDN-0001［R］.Palo Alto,USA:Xerox Palo Alto Research Center,2010. ［3］AHLGREN B,DANNEWITZ C,IMBRENDA C,et al.A Survey of Information-Centric Networking［J］.IEEE Communications Magazine,2012,50(7):26-36. ［4］PODLIPNIG S,BSZRMENYI L.A Survey of Web Cache Replacement Strategies［J］.ACM Computing Surveys,2003,35(4):374-398. ［5］MING Z,XU M,WANG D.Age-based Cooperative Caching in Information-Centric Networking［C］//Proceedings of International Conference on Computer Communication and Networks.Washington D.C.,USA:IEEE Press,2014:1-8. ［6］RAN J,LU N,ZHANG D,et al.On Performance of Cache Policies in Named Data Networking［C］//Proceedings of International Conference on Advanced Computer Science and Electronics Information.Washington D.C.,USA:IEEE Press,2013:668-671. ［7］EUM S,NAKAUCHI K,MURATA M,et al.CATT:Potential Based Routing with Content Caching for ICN［C］//Proceedings of the 2nd ICN Workshop on Information-Centric Networking.New York,USA:ACM Press,2012:49-54. ［8］CHAI W K,HE D,PSARAS I,et al.Cache “Less for More” in Information-Centric Networks［C］//Proceedings of Inter-national Conference on Research in Networking.Berlin,Germany:Springer,2012:27-40. ［9］PSARAS I,CHAI W K,PAVLOU G.Probabilistic In-network Caching for Information-Centric Networks［C］//Proceedings of the 2nd ICN Workshop on Information-Centric Networking.New York,USA:ACM Press,2012:55-60. ［10］LAOUTARIS N,CHE H,STAVRAKAKIS I.The LCD Interconnection of LRU Caches and Its Analysis［J］.Performance Evaluation,2006,63(7):609-634. ［11］崔现东,刘江,黄韬,等.基于节点介数和替换率的内容中心网络网内缓存策略［J］.电子与信息学报,2014,36(1):1-7. ［12］曲桦,王伟萍,赵季红.内容中心网络中一种改进型缓存机制［J］.计算机工程,2015,41(3):41-46. ［13］YI C,AFANASYEV A,WANG L,et al.Adaptive Forwarding in Named Data Networking［J］.ACM SIGCOMM Computer Communication Review,2012,42(3):62-67. ［14］AFANASYEV A,MOISEENKO I,ZHANG L.ndnSIM:NDNSimulator for NS-3［D］.Los Angeles,USA:University of California,Los Angeles,2012. ［15］MASTORAKIS S,AFANASYEV A,MOISEENKO I,et al.ndnSIM 2.0:A New Version of the NDN Simulator for NS-3:NDN-0028［R］.Palo Alto,USA:Xerox Palo Alto Research Center,2015. 编辑金胡考

[1]	高子轩, 郑烇. NDMANET中基于内容优先级的缓存策略研究[J]. 计算机工程, 2021, 47(3): 190-195.
[2]	尚佳佳, 霍如, 耿丽萍, 汪硕, 黄韬. 基于NDN的区块链网络服务质量保障方法[J]. 计算机工程, 2021, 47(12): 40-46,53.
[3]	陈秋瑶, 郑烇. 命名数据网络中适用于区分服务的缓存策略研究[J]. 计算机工程, 2020, 46(1): 172-178.
[4]	陈劼博,郑烇,王嵩. 基于节点介数与边缘流行度的NDN缓存策略[J]. 计算机工程, 2019, 45(5): 46-51.
[5]	胡亚萍,王子磊. 一种命名数据网络的视频全域协作缓存算法[J]. 计算机工程, 2018, 44(5): 280-285,295.
[6]	房晓阳,季新生,刘彩霞,杜福德. 基于局部流行度的分布式协作缓存策略[J]. 计算机工程, 2018, 44(5): 94-100,106.
[7]	丁尧,郑烇,郭晨,王嵩. 基于节点热度与缓存替换率的ICN协作缓存[J]. 计算机工程, 2018, 44(2): 56-60,67.
[8]	刘锐,李俊. 内容中心网络中基于K核分解的缓存决策策略[J]. 计算机工程, 2017, 43(4): 90-93,99.
[9]	曲桦,王伟萍,赵季红. 内容中心网络中一种改进型缓存机制[J]. 计算机工程, 2015, 41(3): 41-46.
[10]	刘涛，程东年，田铭. 基于副本通告的内容中心网络快捷路由机制[J]. 计算机工程, 2014, 40(5): 62-67.
[11]	张良，刘敬浩，李卓. 命名数据网络中基于Hash映射的命名检索[J]. 计算机工程, 2014, 40(4): 108-111,115.
[12]	李尧尧, 顾进广, 刘琼. 基于语义贡献值的XML查询缓存替换策略[J]. 计算机工程, 2011, 37(13): 29-32.
[13]	张艳;石磊;卫琳;. Web缓存优化模型研究[J]. 计算机工程, 2009, 35(8): 85-87.
[14]	王小燕. 一种高效的流媒体代理缓存替换算法[J]. 计算机工程, 2009, 35(14): 72-74.
[15]	杨传栋;余镇危;王行刚;张焕远. 基于流行度预测的流媒体代理缓存替换算法[J]. 计算机工程, 2007, 33(07): 99-100.

选择文件类型/文献管理软件名称

选择包含的内容