Time-predictable routing algorithm for Time-Sensitive Networking: Schedulable guarantee of Time-Triggered streams

Abstract

To make manufacturers more intelligent in the production of cyber-physical systems (CPS), the IEEE 802.1 working group proposes a Time-Sensitive Network (TSN) standard based on traditional Ethernet. TSN can help the industrial environment to realize intelligent real-time transmission requirements. At present, the research on TSN focuses mainly on how to optimize the scheduling table synthesis to reduce the end-to-end delay of the frame. Routing selection typically uses the common shortest path first (SPF) and weighted shortest path first (wtSPF) algorithms. The path chosen by these algorithms can only ensure a low end-to-end delay of newly added streams, but they cannot guarantee the success rate of scheduling newly added streams or determine whether the delay will have a serious impact on other streams. Therefore, this paper proposes a scheduling routing algorithm for the TSN environment, named Real-Time Routing Scheduler (RTRS), which is applicable to Time-Triggered (TT) streams with immediate constraints. Based on the calculation of the end-to-end maximum delay time, the RTRS is used as a basis for routing to ensure that all TT streams are transmitted within the deadline. The experimental results show that the RTRS algorithm can provide an excellent real-time performance of CPS, improve the scheduling success rate, optimize the maximum end-to-end delay, and ensure that newly added streams do not easily affect the transmission of other streams.