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

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

Full description

Saved in:
Bibliographic Details
Published in计算机工程 Vol. 44; no. 2; pp. 46 - 50
Main Author 郭晨;郑烇;丁尧;王嵩
Format Journal Article
LanguageChinese
Published 中国科学技术大学自动化系未来网络实验室,合肥,230026 2018
Subjects
动态流行度
命名数据网络
缓存决策
缓存替换
请求代价
命名数据网络
缓存决策
动态流行度
请求代价
缓存替换
Online AccessGet full text
ISSN1000-3428

Cover

More Information
Summary:TP393; 为实现高效的命名数据网络(NDN)缓存替换,设计动态流行度与请求代价相结合的缓存替换策略.使每个节点单独计算缓存内容的动态流行度与请求代价的加权(DPC)值,并基于该值进行缓存内容的替换,保留高流行度与高请求代价的内容.在此基础上,根据内容的DPC值对其分类,执行区分化的缓存决策算法,合理选择节点放置缓存.实验结果表明,相对于典型NDN缓存策略,该策略能有效提高缓存命中率,降低平均跳数.
Bibliography:31-1289/TP
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）
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.
Named Data Networking（NDN） ; dynamic popularity;request cost ; cache replacement ; cache decision
ISSN:1000-3428