Research On Information Storage Optimization In Named Data Networking

With the development of society and technology,the Internet is constantly merging in all walks of life,and the amount of data in the network has thus exploded.Users are also paying more and more attention to the data content itself rather than the physical address where the data resides.The traditional TCP/IP network was designed to meet the sharing of computer hardware resources.The traditional network architecture with the host physical address as the core has gradually failed to adapt to the current network development in terms of mobility,security and reliability.So many researchers have invested in the research of future network architecture.As the representative of the future network architecture,the information center network ICN has been highly concerned with its unique advantages.Among them,the named data network NDN is a branch of the ICN network,and its intra-domain cache makes it an outstanding representative in the ICN network.Compared with traditional TCP/IP networks,NDN can better meet user requirements in network performance such as transmission delay.One of the important features of the NDN network is the distributed caching technology,in which not only the server and the host can store data information,but also the NDN router can store the data information forwarded by the NDN network.The caching function of the NDN network node reduces the packet transmission distance in the network,thus reducing the network delay,and the cache function of many nodes increases the network cache hit ratio and reduces the server load.At present,the research on the NDN network caching method mainly focuses on distinguishing the cache for the popularity of the data information and the difference of the location of the cache node.The data throughput of the core node of the NDN network is large,so the data information replacement operation is performed at a high frequency,thereby increasing the node is burdened,resulting in low cache capacity utilization,wasted cache space resources,and there will be more duplicate data information,resulting in cache redundancy.Aiming at the above problems,this paper proposes a Bloom filter-based Request Node Collaboration(BRCC)method based on the summary information,which introduces the data information cache revenue and the NDN node cache revenue parameters.High data information is cached in the neighboring nodes of the user for a long time,so as to shorten the delay of the user to obtain data.After comparing with the three classic cache methods of NDN,the method can be seen in the cache time and network request delay,packet transmission average routing hops,first-hop hit rate and cache hit rate have certain advantages.The main work of this paper is as follows: The node revenue in the NDN network varies with the location of the node.This paper uses multiple pre-experimental analysis to find that the node closer to the user has better cache yield than the node far from the user node;the data cached in the NDN network The information has different popularity due to the frequency of user requests.This paper uses pre-experimental analysis to obtain better cached data information.The use of neighbor node cooperative caching can effectively improve the diversity of cached data in the network.The network cache redundancy is reduced.The Bloom filter-based query matching algorithm is introduced in the query matching process of the NDN network packet to effectively reduce the query matching time and reduce the node load.