The Research Of Caching Strategy And Searching Algorithm In CCN

In order to solve many problems exposed by the current network,the research on the future network architecture has formed a new field.Content-Centric Networking(CCN)is a very important research object in this field.The content center network is an innovation of network technology.The traditional IP network cares about the storage location of data,while the content center network only focuses on the data.Data becomes the core of the Internet architecture,fundamentally solving the problems of exhaustion of IP address,security,mobility and other traditional issues,the system architecture and related support technology research have become hot spots.As a new type of network architecture,this network solves the problem of massive information requests through intranet caching.Each node has the ability to cache data.Therefore,caching is important on the overall performance of the content center network.This paper introduces the system model of content center network,and studies caching strategies and search algorithms.In existing caching strategy,there is a lack of cooperation mechanism among nodes in the network,and neighboring nodes can not exchange information,resulting in a slow request lookup.Based on this problem,this paper proposes a collaborative caching strategy,which divides the network into multiple autonomous system(AS),and the control node of each system is designated,and the caching situations of other public nodes are coordinated and summarized.In this collaborative caching strategy,the request can quickly find the content of the node,in order to obtain a higher request processing speed.In order to make the conclusion more universal,we simulate the average number of hops,hit rate and delay time of the existing strategy and collaboration caching strategy for any network topology.The comparison results show that the cooperation caching strategy makes the network performance better.By the study of existing cache lookup algorithms,we found the lookup of Forwarding Information Base has been the most time-consuming part during the entire request discovery process.In response to this phenomenon,this paper presents a FIB search algorithm,in the algorithm,there are the bloom filter,hash table and balanced binary tree,each hash entry links to a balance Binary tree.On the one hand,the bloom filter can filter out some wrong requests and reduce the request processing time of the whole network.On the other hand,the balanced binary tree can ensure that the processing speed of the requests,and be controlled the search algorithm has the worst time complexity of O(log N) in any case.After the simulation experiment,compared with several existing FIB search algorithms,under the proposed algorithm,the lookup time of the FIB table obviously drops,which improves the overall search speed of the network.