Cache Pollution Prevention Mechanism Based on Cache Partition in V-NDN

TLDR: Experiments show that the cache partition mechanism can effectively resist the attack of cache pollution, and the number of Interest packets requested by normal users in the whole network has also been greatly reduced, which greatly reduces the traffic within the network.

Abstract: The information-centric networking, which aims to solve the demand for distributing a large amount of content on the Internet, has proved to be a promising example for various network solutions, such as the Vehicular ad-hoc network (VANET). However, some problems are introduced when the named data networking is combined with V-NDN, such as the cache pollution. In order to solve the cache pollution attack, we propose a mechanism based on cache partition, which divides the cache of nodes into two parts and stores the content of different popularity respectively. We monitor the interest packets received by each node and get the corresponding popularity of each content. According to the popularity of the content, the content is stored in the corresponding cache. In addition, when the popularity of the content changes, we add the name of the content to the monitoring list to determine whether it is an attack content. This paper simulates the cache partition mechanism under different request frequencies and different forwarding strategies. The experimental results show that the average hit rate of node cache can be increased by 14% and the user request delay can be reduced by 30% when the node is attacked. At the same time, the number of Interest packets requested by normal users in the whole network has also been greatly reduced, which greatly reduces the traffic within the network. Experiments show that the cache partition mechanism can effectively resist the attack of cache pollution.