A Window-Based Heuristic TSN Scheduling Algorithm Using Array Theory Encoding

The Time Sensitive Network (TSN) based on Ethernet extends standard Ethernet into a deterministic network with real-time functionality through a series of sub standards. This paper designs a mathematical model using array theory, which transforms the gate control mechanism into an array of window opening and closing events while retaining the original model, making it applicable to the general situation of TSN networks (multiple frames per stream, multicast streams). In addition, based on the preprocessing algorithm proposed in this paper for synthesizing link sequences, a multi-objective heuristic optimization offline scheduling algorithm based on SMT was designed to schedule each link with the shortest GCL length and the smallest number of occupied queues. This algorithm has the ability to solve in polynomial time and reserves more time and space resources for the network. The performance evaluation using the Z3 solver shows that the optimized algorithm has significantly improved performance compared to the original algorithm.