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