Research On Intradomain Efficient Routing Protection In The Internet

In the past few years,the arrival of big data,timely applications and huge amount of data depend on the uninterrupted service provided by the Internet,but network faults are unavoidable.As an important technology to improve Internet availability,route protection technology can play an important role in the application services with high network delay requirements.Moreover,it can solve the network interruption and message loss caused by network faults,so the research on it has never been interrupted.The earliest known route protection algorithm that adopts the hop forward mode is Equal-cost multipath routing(ECMP).From the birth of equal-cost multipath routing to the emergence of deep learning,the performance of the route protection method has been greatly improved.However,routes are faced with many challenges in the field of route availability.In practical applications,there are still some defects,such as high computational complexity,failure to cope with the impact of most single-link network failures,and failure to protect all nodes.Therefore,it is urgent to improve the route availability of the current route protection method.Currently,route protection algorithms based on the DC rules generally have high computational complexity or low fault protection rate.In view of the above problems,this paper studies on the basis of DC rules and SRv6,aiming to achieve efficient route protection methods to deal with the impact of most of the current single-link network failures,so as to improve route availability and network self-healing.The main research contents of this paper include:(1)There are many nodes in the network,and the average degree of each node increases with the continuous addition of nodes,which leads to the increasing complexity of the implementation of DC rules and greatly increases the calculation overhead.This problem is common in the existing route protection methods based on DC rules,and the lowest complexity is equivalent to the generation of a shortest path tree.To deal with this problem and ensure that the fault protection rate of DC rules is not reduced,this paper realizes an efficient route protection method with linear time complexity.Based on the original shortest path tree,the calculation cost of DC rules is effectively reduced without affecting the fault protection rate and path stretching degree.It is applied to the actual demand,and an efficient protection system based on DC rules is developed.The system realizes the network topology reading,visualization,backup next hop,backup path calculation and output the results.(2)In order to improve the low fault protection rate of the DC protection method,the fault protection rate can reach 100%.On the basis of the programmability of SRv6,this paper puts forward the method of intra-domain route protection based on SRv6.Firstly,an incremental shortest path tree is reconstructed by the incremental shortest path first algorithm,and then on the generated incremental shortest path tree,the backup path of source-destination node pair can be calculated.The complexity of the method is equivalent to constructing a shortest path tree.On this basis,the calculation rules of Segment List are put forward.Under the premise of reducing the calculation overhead,this method has better performance in the failure protection rate and path stretch.