ILP-based dynamic flow balancing scheduling algorithm in time sensitive network

In order to solve the problem that off-line scheduling is often used in Time Sensitive Network (TSN), and the scheduling overhead is too high when dealing with dynamic demands, a dynamic flow balancing scheduling algorithm based on integer linear programming (ILP) for TSN is proposed.Based on the generated offline scheduling table, the algorithm can effectively reduce the overhead caused by topology and service changes through an incremental calculation method. At the same time, according to the extreme situation of the link load, the traffic balancing strategy is formulated to avoid the delay bottleneck problem, and then improve the real-time communication performance. Experimental data shows that compared with the traditional static scheduling algorithm, the computing time is greatly reduced and the link load is balanced better.