面向缓存命中率的命名数据网络缓存优化策略  

Cache hit ratio oriented named data networking cache optimization strategy

作　　者：高全力 杨昊 李雪花 赵辉 金帅 徐国梁 GAO Quanli;YANG Hao;LI Xuehua;ZHAO Hui;JIN Shuai;XU Guoliang(School of Computer Science,Xi’an Polytechnic University,Xi’an 710048,China;Shandong Ruyi Woolem Garment Group Co.Ltd,Jining 272000,Shandong ,China;Shandong Ruyi Hengcheng New Material Technology Co.Ltd,Jining 272000,Shandong,China)

机构地区：[1]西安工程大学计算机科学学院,陕西西安710048 [2]山东如意毛纺服装集团股份有限公司,山东济宁272000 [3]山东如意恒成产研新材料科技有限公司,山东济宁272000

出　　处：《西安工程大学学报》2022年第1期101-107,共7页Journal of Xi’an Polytechnic University

基　　金：国家自然科学基金(61902300);陕西省自然科学基金(2019JQ-850);山东省重点研发计划重大科技创新工程(厅市联合)项目(2019TSLH0209)。

摘　　要：针对命名数据网络(named data networking,NDN)传统缓存策略存在缓存命中率较低、平均路由跳数较高的问题,提出了面向提高缓存命中率的缓存优化策略。对于每个路由节点,结合当前已缓存内容块的命中次数,以及请求命中的时间特性计算各个内容块的动态优先权值;然后根据此值进行缓存内容块的替换,保留当前请求率高且预计未来请求率高的内容块。在此基础上,根据内容请求路径上各路由节点缓存内容的优先权平均值,设计了高优先权缓存决定策略,从而选择合理的缓存放置节点。仿真实验结果表明,相较于典型的NDN缓存策略,该策略能有效提高缓存命中率,降低平均请求跳数。Aiming to solve the problems of low cache hit rate and high average routing hops in the traditional cache strategies of named data networking(NDN),a cache optimization strategy for improving cache hit ratio is proposed.For each routing node,the dynamic priority value of each content block was calculated by combining the hit times of the current cached content block and the hit time characteristics of the request.The cached content block was then replaced according to this value to retain the content block with high current request rate and expected high future request rate.On this basis,according to the average priority value of each routing node on the content request path,a high priority cache decision strategy was designed to select a reasonable cache placement node.A large number of simulation results show that compared with the typical NDN cache strategy,this strategy can effectively improve the cache hit rate and reduce the average request hops.

关 键 词：命名数据网络 缓存策优化略 缓存命中率 平均路由跳数 动态优先权 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]