Adaptive Priority Adjustment Scheduling Approach With Response-Time Analysis in Time-Sensitive Networks
Yazhou Yuan, Xu Cao, Zhixin Liu, Cailian Chen, Xinping Guan
Abstract
With the advent of Industry 4.0 and the popularization of smart terminal equipment, the interaction between industrial field information systems and production equipment has intensified. To meet the real-time transmission of time-triggered flow and the coordinated transmission of best effort flow, time-sensitive network-related technologies are used to implement flow queue forwarding by strictly following the gate control list. First, response-time analysis method is proposed to predict the upper bound of delay under a scheduling model following IEEE 802.1Qbv. Second, according to response-time analysis, a deadline monotonic scheduling algorithm with temporary priority expansion is proposed to divide the priority into more levels, which is not limited by the queue type, so as to ameliorate the transmission sequence of switch export flow. Finally, an adaptive priority adjustment scheduling algorithm with temporary priority expansion is designed to construct the optimal scheduling method further improving the scheduling success rate and reducing worst-case end-to-end delays. Compared with similar algorithms, the algorithm proposed improves the scheduling success rate by at least 30%, reduces the total delay by at least 21% and the TT flow delay by 11% in high network utilization conditions.