An Online Incremental Scheduling Method for Time Sensitive Networks Combined with Routing

Abstract

Time sensitive network is an extension of standard Ethernet network, which meets the delay and jitter requirements of critical traffic in specific fields through various mechanisms. The time sensitive network calculates the traffic schedule that meets the critical traffic requirements by planning the overall network traffic, which is NP-complete. When there is a new flow demand in the network, most of the existing solutions are to resolve the schedule table for all network traffic, which is time-comsuming. To provide a solution on such problem, we propose an incremental scheduling method for time-sensitive network so that the scheduling table corresponding to the new traffic in the network is therefore solved. The method adopts a combination of routing and scheduling, selecting alternative routing paths for traffic via heuristic methods, and then performs incremental scheduling on the gate control list of the devices selected by the routing to solve the feasible scheduling of new flows. The experiment results show that, compared with the traditional static scheduling scheme, the method can greatly speed up the process of scheduling and solving, and is able to solve the problem within seconds, meeting the needs of online incremental scheduling.