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.

The default LCE caching strategy of the Information-Center Networking(ICN) which caches content on each node on the return path of the packet generates a large number of redundant copies and cannot make full use of the cache resources.To solve this problem,a caching strategy based on heat and cache replacement rate of node is proposed.It chooses special nodes on packet return path cache content.Considering the network traffic of regional differences and different time difference,it computes heat cache and replacement rate of node periodically,as a measure of whether the content is cached in node.Experimental results show that,compared with LCE and CLFM strategy,the proposed strategy can reduce average number of hops and server hit ratio,meanwhile getting higher caching benefit.

Cache is one of the key technologies of named data networking(NDN).However,the basic cache scheme LCE (leave copy everywhere) in NDN leads to much redundancy.The RCOne scheme chooses the cache node randomly without using any information of content and node,which is limited in improving cache performance.The Betw scheme results in that the node has the more frequent replacement with the larger betweenness centrality,which will decrease the cache performance when the node's cache capacity is far smaller than the total content amount.In order to solve those problems,a cache scheme named HotBetw is proposed in this paper based on content popularity and node betweenness to choose appropriate cache node along the content delivery path.The simulation results show that the HotBetw cache scheme can achieve higher cache hit ratio and reduce average request hop compared with existing schemes.