Abstract: Globally,the fusion of industrialization,informatization,and intelligence is significantly impacting various industries,especially in fields requiring stringent latency,such as in-vehicle systems and avionics.TSN has emerged as a key technology for achieving deterministic low-latency communications.However,TSN’s current network-level traffic scheduling mechanisms struggle to fully meet the complex priority demands of upper-layer services.To address this issue,this paper proposes an SMT-based TSN scheduling mechanism called SMT-TAS.By incorporating an SMT solver into the existing TAS model,and designing a traffic scheduling algorithm based on priority satisfaction rate,SMT-TAS enables real-time generation of optimal scheduling schemes based on dynamic business scenarios.Experimental results demonstrate that compared to traditional TAS methods,SMT-TAS improves the average priority satisfaction rate by approximately 20%,significantly enhances system schedulability,and reduces end-to-end latency by around 10%,demonstrates outstanding performance in terms of solving efficiency.Furthermore,it exhibits higher stability and reliability in large-scale tasks,effectively meeting various TSN scheduling constraints,providing strong support for the further development and application of TSN.

Key words: Time sensitive networking, Satisfiability modulo theories, Traffic scheduling, Priority assurance