A Segment List Selection Algorithm Based on Delay in Segment Routing

Segment Routing is increasingly being used in net- work traffic scheduling, while the number of delay-sensitive services in the network is increasing. However, calculating a segment list based on bandwidth alone is not good enough for scheduling experiment-sensitive services. In this paper, we calculate a segment list with delay guarantee effect in two steps. In the first step, an auxiliary graph is constructed by extracting some of the nodes in the network to reduce the network topology complexity, and in the second step, the segment list is calculated by Bellman–Ford algorithm based on the auxiliary graph and the link weights derived from the delay algorithm. We also construct a test environment based on Programming Protocol-independent Packet Processors (P4) to verify that the segment list generation algorithm proposed in this paper can optimize the delay of traffic.