Research On Named Look-up Scheme For Named Data Networking

At present,on the Internet,a large amount of multimedia content is being widely transmitted,and mobile applications are becoming more and more popular,requiring a large number of IP addresses to establish communication links between high-speed data providers and information requesters.However,the traditional TCP/IP protocol has many problems in terms of mobility and security,so Name Data Networking(NDN)has received more and more attention.Named data networking uses content names for routing lookup and forwarding.Compared with the IP network,the name lookup method has many different features.The name lookup method adopts a hierarchical naming method to name data is one of the key features.This naming method specifies the content of each data packet.A URL-like name,but frequent distribution and removal of content can lead to inefficient name lookups.Therefore,how to carry out high-quality transmission of named data network in a large-scale network has become a major difficulty.This thesis conducts research on this problem,and the main work is as follows:1.Design a concise prefix tree STire search method.Starting from the prefix tree Tire,two improved methods based on prefix tree are analyzed in detail: path compression name prefix tree PC-NPT and level priority prefix tree LPT.Starting from the data structure,the search characteristics of two different data search methods are analyzed respectively.According to the comparison experiment between its different search process and the original search method Tire,the advantages and disadvantages of the two different methods are analyzed,and a concise prefix tree STire is proposed on this basis.Aiming at the pain point that each node of Tire contains a character,which causes the depth of the prefix tree to be too large,STire modifies the character of each node into a component,thereby reducing unnecessary searches.When two or more name components are the same,STire will collapse the nodes,thereby reducing the search for redundant nodes,reducing the repetition of name nodes,and reducing the memory occupied by non-repeated name prefix searches.By combining the same characters The extraction method is used to reduce a part of the search time,thereby improving the search efficiency.2.Design a naming data network name lookup scheme based on STire.A single data lookup structure can no longer meet the needs of name routing lookups.In this paper,considering the name characteristics of the named data network,the FIB is divided into three parts: the counting bloom filter CBF,the popular FIB and the concise prefix tree STire for name search,and the search scheme is combined with the path compression name prefix tree PC-NPT,level Three search schemes such as priority prefix tree LPT and BF-PDT are compared and analyzed.Experimental results show that the name lookup scheme is faster than other schemes in terms of creation speed and lookup speed,but slightly higher than LPT and BF-PDT schemes in terms of memory overhead.