Research On Network Traffic Scheduling Method Based On Segment Routing

As a key network technology,network traffic scheduling plays a critical role in controlling network congestion,improving network resource utilization and ensuring data security.Traditional routing protocols have limited capability for traffic control and complex operation,which greatly limit the ability of network traffic scheduling.Segment Routing(SR),an emerging source routing technology,can control routing paths more flexibly.The application of segment routing to network traffic scheduling is certainly of great importance.The combination with Software Defined Network(SDN)technology makes it possible for segment routing to manipulate traffic at a fine-grained level and centralize routing in WANs.On the other hand,segment routing for traffic scheduling requires pre-selecting some relay nodes.And network operators require determining the number of segments and the sequence of relay nodes.Extending segments can improve routing path flexibility but also increases computational complexity.How to select the appropriate segment routing paths for multiple data flows is a pressing problem? To this end,the following four aspects of research are conducted in this paper.1)Systematically describes the research results of segment routing in scheduling network traffic.In traditional networks,due to the lack of a global controller,traffic scheduling usually requires network nodes to learn from each other and obtain network information through OSPF protocols and so on.In segment routing,the presence of a global controller in the network allows for more effective traffic control using segment routing.In this paper,this process and related research results are systematically reviewed.2)A model and algorithm are proposed for the multi-segment routing traffic engineering optimization problem.In the network that support segment routing,previous work has focused on 2-or 3-segment routing.To address this background,this paper presents the traffic optimization problem for multi-segment routing in general scenarios.Based on its model,the problem is shown to be NP-hard.Then a multi-segment routing algorithm based on restrained widest path is designed.3)A model and two algorithms are proposed for the segment avoidance routing problem.Ensuring that traffic is not intercepted by malicious nodes is an important research direction for network security.In this paper,an integer programming problem using segmented routing technique to circumvent malicious nodes is given and proved to be a special case of constrained shortest path.In this paper,two algorithms are proposed for segment avoidance routing based on completed network information and segment avoidance routing based on partial network information.In the algorithm analysis,the proof of algorithm correctness and the analysis of performance such as complexity are given.4)In this paper,extensive experiments are conducted to evaluate the performance of the proposed algorithms.The impact of network traffic size,network topology size,number of segments,and other parameters on the performance of the algorithms is evaluated through experiments to comprehensively compare the advantages and disadvantages of each algorithm.