An Efficient Local Search Algorithm for Traffic Engineering in Segment Routing Networks

Segment Routing (SR) is a flexible and efficient source routing paradigm which allows traffic to be forwarded along any possible path in the network by using different segment identifiers (SIDs). Segment routing has no additional overhead in maintaining routing information at intermediate forwarding nodes, making it highly scalable and widely used in traffic engineering. However, current researches have some shortcomings in terms of network load balancing and completeness of supporting SR characteristics, which limit the optimization performance. In this paper, we designed a heuristic traffic engineering algorithm called SR-ELS, based on the two segments routing model (2-SR). The algorithm supports the adjacency segments and flexible source node traffic splitting strategy. Experimental results show that the algorithm has a near-optimal performance in reducing the maximum link utilization and excellent operational efficiency.