An Optimization Meta-heuristic Algorithm Based on Segment Routing

Segment routing is a new routing paradigm that directs traffic through segment lists. Because of its ability to program detours in forwarding paths on a large scale, segment routing can better implement traffic engineering. Previous related work has been done mainly based on integer linear programming, which does not have a better strategy for coping with rapid network state changes. This work proposes an optimized local search algorithm that enables the path calculation unit (PCE) or SDN controller to quickly calculate the changed path in a short time. Moreover, we take both prefix-sid and adjacency-sid into account to achieve optimal utilization of network resources. Our experimental results show that we are able to optimize the network paths in less time than the previous algorithm, thus achieving millisecond response to network state changes.