Traffic Scheduling Based on Iterative Path Selection in Time-Sensitive Networks

More and more industrial networks need to achieve deterministic transmission with low latency and high reliability. In order to ensure the time-sensitive traffic could be transmitted to its destination before the deadline, and improve the schedulability of traffic under different network scales, a traffic scheduling algorithm based on iterative path selection is proposed. According to the possibility of conflicts between traffics, the optimal transmission path is pre-selected for each traffic, and relevant scheduling constraints are defined. The integer linear programming (ILP) method is used to solve the scheduling problem. Experiments conducted under different network scale and number of traffics, the results show that, compared with the traditional shortest path routing scheduling method, the proposed method improves the scheduling success rate but not reduces the computation efficiency, which is more suitable for relatively largescale networks.