Cache hit ratio oriented named data networking cache optimization strategy

Abstract

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.

Keywords

• named data network
• cache optimization strategy
• cache hit rate
• average route hops
• dynamic priority