Design Of IPv4/IPv6 Transition Strategy Based On NDN And Research On Routing Lookup Algorithms

The depletion of IPv4 addresses provides an opportunity for IPv6 to introduce the Internet,so IPv6 rapid and efficient deployment in the implementation of the Internet has become a research hotspot.IPv4 to IPv6 transition is a long-term and gradual process,and it requires transitional technology to support communication between heterogeneous networks.There are already many IPv4/IPv6 transition technologies,some have been applied to practice,the other is only a solution.The dual stack mechanism is the basis of other transition technologies,but it is not widely deployed;tunneling and encapsulation methods are used more widely,but all encapsulation mechanisms are limited by increased network traffic;address family translation are often not considered to be a long-term viable strategy.Based on the introduction and research of three transition technologies,this paper mainly studies the tunnel encapsulation method and translation technology.We proposed Design of IPv4/IPv6 transition strategy based on NDN.Aiming at the problem of increasing the number of BGP routes on the IPv6 network in the transition strategy model,we proposed to improve the IPv6 address lookup algorithm.1.Design of IPv4/IPv6 transition strategy based on NDN.After analyzing the basic technology of IPv6 transition process and the SDN-based IPv6 transition scheme,the advantages and disadvantages of the technology are summarized.On this basis,the NDN network is introduced into the transition process.In this paper,NDN and IPv4/IPv6 transition technology combined,we proposed IPv4/IPv6 transition strategy based on NDN,combined with the case of DNS to complete the communication between heterogeneous networks.In this transition model,there is a mapping relationship between domain,IPv4 and IPv6.And a mapping algorithm based on hash is proposed according to the mapping relation between them.Finally,the algorithm is validated by experiment.The experimental results show that the algorithm search efficiency is superior to traditional algorithms.2.An IPv6 address lookup algorithm based on multi-bit trie and prefix hierarchy: Firstly,the traditional routing algorithm is classified and the advantages and disadvantages of the algorithm are summarized.Then,the routing prefix and the first 16 bits are analyzed,and an improved IPv6 address lookup algorithm is proposed.This algorithm consists of two layers of data structure,in which the first layer data structure is constructed by 4-bit trie,the first 16 bits of the route prefix are inserted into 4-bit trie to ensure the scalability and search efficiency of the algorithm.The second layer data structure is constructed according to the prefix hierarchy and is constructed by B-tree.Finally,the simulation results show that the proposed algorithm is superior to Radix and Patricia in the search and memory occupancy.