A Heuristic-based Dynamic Scheduling and Routing Method for Industrial TSN Networks

In the industrial environment, machines often need to reflect the anomaly detection results to the total control center in time, and the general industrial network can not achieve high real-time. In order to solve such challenges, a set of protocol standards developed by IEEE802.1 working group, namely Time-sensitive Networking (TSN), has been introduced into industrial networks. TSN can provide high real-time and reliability for data transmission, where the reliability is achieved by Frame duplication and Frame Elimination (FRER). In the realization process of FRER, it is necessary to determine the source node, destination node, and multiple disjoint paths to transmit redundant data. However, the transmission of these redundant traffic may result in the delay of other flows, and then affects the user experience. Therefore, it is very important to choose excellent redundant traffic paths to ensure reliability and reduce the impact on other flows. In the existing research, there are many dynamic scheduling and routing heuristics to determine the path, but they do not consider the influence of the location of the source node on the whole route scheduling. This paper proposes an improved dynamic scheduling and routing heuristic method, which takes the source node into account in the routing selection. In the flow test experiments of different magnitudes, it is found that the total delay of all flows is reduced by 1.4%-4.5% under the same magnitude of schedulability compared with Ant Colony Optimization.