Research On Real-Time Scheduling Algorithm For Industrial Time-Sensitive Network

With the gradual application of Industry 4.0 technology,the integration of information systems and production equipment has become increasingly common.However,traditional Ethernet networks have difficulty handling the real-time demands of vast amounts of mixed data.This has created an urgent need for more rigorous timing requirements,particularly due to the impact of equipment operations,process data,and production tasks on network transmission and control strategies.To address this challenge,the IEEE Time-Sensitive Networking Working Group has proposed deterministic Time-Sensitive Networking(TSN)technology to enable low-latency hard real-time transmission of mixed traffic in the network.The specific research content is as follows:In view of the exponential growth of industrial information traffic,The transmission capacity of traditional Ethernet technology is limited which cannot guarantee the deterministic mixed transmission of unpredictable emergency burst traffic(EB)and periodic time-sensitive traffic(TT).This thesis proposes a virtual shadow queue-based priority inversion protection(VSQ-PIP)method based on the time-sensitive framework that meets the deterministic requirements of both TT and EB traffic.The proposed VSQ-PIP method includes a virtual shadow queue model and a priority inversion protection mechanism to ensure real-time transmission of EB traffic following IEEE802.1Qbv scheduling and ensure real-time transmission of TT traffic under scheduling constraints.Simulation results demonstrate that the proposed method significantly improves scheduling stability and success rate.The guard band mechanism proposed for IEEE802.1Qbv can lead to a certain degree of low link utilization and bandwidth waste.This thesis proposes an adaptive priority adjustment scheduling method based on frame preemption response time analysis.The method aims to reduce bandwidth waste while meeting real-time requirements for mixed transmission of time-sensitive and best-effort(BE)traffic.Firstly,we propose the response time analysis based on frame preemption(RTA-PF)method to analyze the upper limit of delay in the IEEE802.1QBV scheduling model.Secondly,we introduce the temporary priority extended Scheduling based on frame preemption(TPE-PF)method,leveraging RTA-PF.Finally,We based on TPE-PF,an adaptive priority adjusted scheduling based on frame preemption response time analysis(ATPE-PF)method is designed,which enables more flexible optimal scheduling.Simulation analysis shows that our method significantly outperforms similar algorithms under the same conditions by reducing the worst-case end-to-end delay(WCD)in frame preemption and improving scheduling success rate.