High Efficiency Cache Policy In Content-Centric Networking

With the rapid development of the Internet,streaming media and other emerging traffic generated in the Internet with rapid rate,making traditional Internet very difficult to meet the demand for the center with the host.In order to meet the needs of users,improve network performance,the academic communities have proposed a revolutionary architecture named Content-Centric Network(CCN).As one of the key technologies of CCN,network caching has an important impact on network performance.A good caching strategy plays an important role in improving network cache resource utilization,reducing data transmission delay and reducing network load,and so on.Thus,It is important to optimize the performance of the cache system.In this paper,we focuses on two aspects of CCN about cache placement and replacement strategy,aiming at improve the efficiency of CCN cache.In the actual network,different users have different needs of content,the data which is important for users should give priority to ensure that it can better serve users,to reduce access delay,make full use of cache resources and improve user experience.Therefore,this paper puts forward a caching strategy based on content level and popularity in consideration of differentiated service.Firstly,depending on the user's request for content,the content will be divided into different levels,and then calculate the average request level and the total amount of data request based on the content level and the request frequency.Finally,the optimal cache position is selected by comparing the average request level and the content request amount between different nodes on the content request path.At the same time,according to the content level and access frequency to calculate the content cache replacement weight value in a period of time.The simulation result shows that the proposed algorithm is more effective than the CEE+LRU,Prob(0.7)+LRU and Betw+LRU in cache performance indicators such as cache hit rate,average delay and source hit rate.Reasonable distribution of content in the network is the key to reduce cache redundancy and improve network performance.This paper presents a caching strategy based on node importance and content popularity.This method first designs how to select the content storage node in the dynamic network.It counts the number of edge nodes of the node,calculates the average request time of the different edge nodes through the network nodes,when requesting a certain data.And then calculate the cache weight by the number of the edge nodes and the average request time,compare the cache weight of different nodes to select the storage location of the content.At last,according to the number of edge nodes and the content of the request frequency to calculate the weight value,and then utilize the value to select the most important content for users to cache.The simulation results show that this strategy has greatly improved the performance of cache hit rate,average delay,hop save rate and server load.