计算机与现代化 ›› 2022, Vol. 0 ›› Issue (10): 95-99.

• 网络与通信 • 上一篇    下一篇

基于缓存价值的命名数据网络缓存优化策略

  

  1. (1.西安工程大学计算机科学学院,陕西西安710048;2.山东如意毛纺服装集团股份有限公司,山东济宁272000;
    3.山东如意恒成产研新材料科技有限公司,山东济宁272000)
  • 出版日期:2022-10-20 发布日期:2022-10-21
  • 作者简介:杨昊(1997—),男,甘肃武威人,硕士研究生,研究方向:边缘计算,命名数据网络,E-mail: HaoMaster@yeah.net; 高全力(1988—),男,甘肃武威人,副教授,博士,研究方向:边缘计算,E-mail: nickdawn@163.com。
  • 基金资助:
    国家自然科学基金资助项目(61902300); 陕西省重点产业创新链(群)项目(2020ZDLGY07-05); 陕西省自然科学基金资助项目(2019JQ-850); 2019年度山东省重点研发计划重大科技创新工程(厅市联合)项目(2019TSLH0209)

Named Data Network Cache Optimization Strategy Based on Cache Value

  1. (1. School of Computer Science,  Xi’an Polytechnic University, Xi’an 710048, China;
    2. Shandong Ruyi Woolen Garment Group Co., LTD., Jining 272000, China;
    3. Shandong Ruyi Hengcheng New Material Technology Co., LTD., Jining 272000, China)
  • Online:2022-10-20 Published:2022-10-21

摘要: 为了解决当前命名数据网络(Named Data Network)中的传统缓存决定策略如LCE (Leave Copy Everywhere)、LCD (Leave Copy Down)、Prob (Copy with Probability)中存在的由于路由器缓存利用不合理导致的路由器缓存命中率过低,及满足用户请求所需跳数过多导致的时延过大等问题,提出一种基于缓存价值的缓存策略。该策略结合兴趣包路由跳数与所请求数据包大小,以及兴趣包所经过路由节点缓存情况,计算数据包缓存价值,由此将数据包缓存在合适的节点,以提高缓存命中率。在此基础上考虑下游节点的过滤效应,提出相对于传统缓存替换策略LRU、LFU的基于动态缓存价值的缓存替换策略,以进一步提高缓存命中率。经过大量仿真对比实验,验证了本文提出算法的有效性及可用性。

关键词: 信息中心网络, 命名数据网络, 缓存决定策略, 缓存替换策略, 缓存命中率

Abstract: In order to solve the problems such as the low hit ratio of the router cache caused by the unreasonable utilization of the router cache, and the large delay caused by the excessive hops required to meet user requests, which are existing in the traditional cache decision strategies in the current named data network, such as LCE (leave copy everywhere), LCD (leave copy down), and Prob (copy with probability), a cache strategy based on the cache value is proposed. In this strategy, the packet cache value is calculated based on the number of hops of interested packets, the size of requested packets, and the cache condition of the routing nodes through which interested packets pass, and the packets are cached in appropriate nodes to improve the cache hit ratio. On this basis, considering the filtering effect of downstream nodes, a cache replacement strategy based on dynamic cache value of LFU is proposed compared with traditional cache replacement strategy LRU to further improve cache hit ratio. Through a lot of simulation experiments, the effectiveness and availability of the proposed algorithm are demonstrated.


Key words: information center network, named data network, cache decision strategy, cache replacement strategy, cache hit ratio