TS-JRST: TaS-oriented joint routing and scheduling technique for industrial time-sensitive networks

Routing and scheduling are two key issues in the Time Aware Shaper mechanism of the Time Sensitive Network. The traditional method solves routing and scheduling problems separately, which very likely misses some feasible solutions in high-load situations. Existing joint routing with scheduling methods are generally based on integer linear programming. Due to their inability to estimate the time cost, they are unable to meet the real-time transmission of time-triggered streams. In this paper, we have proposed a time-aware Shaper-oriented Joint Routing and Scheduling algorithm (TS-JRST). In terms of routing, we select paths with lower potential flow conflicts and greater relaxation for each time-triggered flow. In terms of scheduling, a non-waiting scheduling method based on adaptive time slots generates new solutions during the perturbation stage. Finally, we use tabu search algorithms to search for solutions with high schedulability in the search space. Through experiments, we compared the performance of our proposed TS-JRST with four other benchmark algorithms in terms of schedulability, time cost, and total latency. The experimental results indicate that the TS-JRST achieves a highly comprehensive capability and can generate routes and scheduling schemes with high schedulability within an acceptable time cost.