Research on Traffic Scheduling for Time Aware Shaper Based on Satisfiability Modulo Theories

With the further development of industrial digital, the amount of information needed to be transmitted in various fields is increasing, and the requirements for real-time are also getting higher and higher. The original Ethernet designed for the transmission of non-real-time information has been unable to meet the current needs. Traffic scheduling technology is introduced into time-sensitive networking (TSN), which uses Time Aware Shaper (TAS) and priority gated queue to ensure real-time transmission. The traffic scheduling problem in time-aware shaper is studied in this paper. The flow and time window are comprehensively constrained. A method based on satisfiability modulo theories (SMT) solver is proposed to generate the gate list in time-aware shaper. By changing the number of flows and network topologies respectively, the scheduling time and successful deployment rate were compared to study the applicability and schedulability of this method. Through the analysis of the simulation results, it is concluded that the method of generating gated list is feasible and suitable for solving some small and medium-sized network traffic scheduling problems.