ILP-based multiperiod flow routing and scheduling method in time-sensitive network

Time-sensitive network (TSN) provides end-to-end data transfer with very low latency and high reliability on the basis of Ethernet. It is suitable for time-sensitive applications and will be widely used in scenarios such as autonomous driving and industrial Internet. When the existing time-sensitive flow routing and scheduling methods do not consider the shared bandwidth of the flow triggered by different cycle times, the possibility of conflict is different, which leads to the inaccuracy of the index to measure the scheduling bottleneck. This paper analyses the different cycle time-sensitive flow between the possibility of conflict, puts forward a kind of applicable to passes based on integer linear programming cycle time-sensitive traffic scheduling algorithm, according to the characteristics of the cycle time-sensitive flow carries on the preliminary classification and sorting, and developed a series of scheduling constraints, implementation is sensitive to time flow of packet scheduling. The experiment can be conducted from the three perspectives of average end-to-end delay, maximum load, and flow scheduling. The proposed routing method was compared with the existing benchmark routing algorithm evaluation. The results show that the proposed method can significantly improve the capacity of the network sensitive to time flow, reduce load scheduling by optimizing the network bottleneck at the same time, and improve the schedulability.