SMT Based Dynamic Traffic Scheduling Method in Time Sensitive Network

To solve the scheduling problem of the incremental traffic in time-sensitive networks, a dynamic scheduling method based on SMT is proposed, which decouple the joint optimization problem of routing and scheduling into two phases. The routing phase provides multiple candidate paths for new traffic according to the descending order of the maximum link load. In the scheduling phase, based on the original scheduling plan, dynamic scheduling is implemented according to the candidate path ordering and constraints of new traffic. Experimental results show that the proposed method can realize real-time scheduling of new traffic while keeping the link load relatively balanced, and optimize the time slot distribution of the scheduling traffic, to provide a large continuous scheduling time for the dynamically arrived traffic, so that the scheduling results can achieve reasonable operation performance.