Research On Caching Security Key Technologies Of Information-centric Networking

With the continuous increase in the number of network access users,the network traffic has exploded,and the main functions of the Internet have changed dramatically,that is,from channel transmission of small-scale data to efficient distribution of large-scale data.It is precisely because of these changes that the traditional Internet architecture has exposed many problems in terms of scalability,location dependence,and efficient transmission.In order to solve the above problems,the information-centric networking is proposed as a new type of Internet architecture.In information-centric networking,each router has a cache storage area to store the requested content,enabling large-scale data sharing.The cache space of the information center network is an open data exchange center.Therefore,several security issues related to caches need to be resolved urgently,including cache privacy leaks and cache pollution attacks.This article focuses on in-depth research on cache privacy protection,cache pollution attack detection and defense in cache security issues.Firstly,in view of the problems of large transmission delay and cache redundancy in the existing cache privacy protection strategies,this paper proposes a multi-attribute cooperative cache decision strategy.This strategy collects the future popularity of the requested content of the node,the betweenness centrality of the node,the hop of the node,and the cache pressure of the node to form a quaternary information set,and then uses the TOPSIS algorithm to make judgments on these quaternary information to obtain the best node cached data content,increasing the uncertainty of ownership of cached content.In the end,this paper verifies the advantages of the cache decision strategy in improving cache hit rate and reducing transmission delay by designing and comparing experiments.Secondly,in view of the low detection accuracy of existing cache pollution attack detection and defense strategies,this paper proposes a cache pollution attack detection and defense strategy based on density clustering.This strategy uses the KANN-DBSCAN algorithm to cluster the request rate and average request interval of the user request behavior.Based on the clustering results,the strategy distinguish whether user requests have followed the Zipf distribution,and then accurately detects cache pollution attacks and their types,and then proposes different types of cache pollution attack defense strategies.Finally,this paper verifies the advantages of this strategy in accurately identifying and effectively preventing cache pollution attacks by designing and comparing experiments.