关键词: 命名数据网, 替换策略, 流行度

Abstract: How to effectively solve the cache replacement problem in the NDN（Named Data Networking） nodes, this paper puts forward a strategy “Po-Rep” to predict the popularity of all every cache chunk stored in the node. When a cache chunk traverses from the hit nodes, the strategy determines the coming cache chunk which will be stored in the node replacing the one with the least value. According to the request frequency and request time interval of the cache chunk, this strategy accurately predicts the popularity of the content in the node. So that all of the contents in a node can maintain the maximum value, which can satisfy the following user requests. The simulation results show that this strategy can improve the hit rate in the stored nodes of the network, reduce the server load and improve the overall performance of the Named Data Networking.

Key words: Named Data Networking（NDN）, replacement strategy, popularity