Adaptive Scheduling Algorithm Based on Time Aware Shaper

At present, Time-Sensitive Networking has attracted extensive attention in automatic driving, Industrial 4.0, 5G and so on. TSN is used to guarantee the real-time transmission of critical traffic with bounded delay, which is realized by a variety of traffic scheduling mechanisms. One important mechanism of research is Time Aware Shaper mechanism, but current researches on this mechanism usually have the following problems: (a) It takes a long time to get the solution of the algorithm; (b) It’s difficult to schedule burst traffic and the algorithm depends on time synchronization; (c) There is a waste of bandwidth. The core idea of TAS mechanism is time division multiplexing, and the solution of transmission time is the key of traffic scheduling. This paper proposes an adaptive scheduling algorithm based on TAS to avoid above problems. First, the worst-case scheduling problem of actual traffic is seen as the scheduling problem of continuous traffic, and the transmission time of continuous traffic of the worst-case delay is analyzed; Second, the concept of queue scheduling is proposed to optimize scheduling, which achieves the adaptive scheduling of actual traffic, does not depend on time synchronization, and improve bandwidth utilization; Finally, the worst-case delay of the algorithm in actual traffic scheduling is analyzed.