时间敏感网络中基于EDWF-MTTF的启发式调度算法

EDWF-MTTF-based heuristic scheduling algorithm in time-sensitive networks

随着工业控制和信息网络的快速融合发展,基于以太网的时间敏感网络受到了广泛关注。时间敏感网络采用时间触发通信调度来保证数据传输的确定性。然而,现有调度算法难以快速计算大规模周期性流量的调度表。因此,设计了基于带权重的最早截止时间-最大传输时间优先的启发式调度算法,通过灵活适配流量排序权重以及回溯增强等方法,可以在较短时间内解决工业自动化场景中大规模流量的调度问题。实验结果表明,相比经典整数线性规划方法,带权重的最早截止时间-最大传输时间优先的启发式调度算法能更快地计算出大规模周期性流量调度表的较优解。

With the rapid integration and development of industrial control and information networks,time-sensitive networks based on ethernet have received widespread attention.In these networks,time-triggered communication scheduling is adopted to ensure the determinacy of data transmission.However,existing scheduling algorithms have struggled to rapidly calculate the scheduling tables for large-scale periodic traffic.Therefore,a heuristic scheduling algorithm based on the earliest deadline with weight first-maximum transfer time first was designed.This algorithm,by flexibly adapting traffic sorting weights and enhancing backtracking methods,could resolve the scheduling issues of large-scale traffic in industrial automation scenarios in a relatively short time.Experimental results show that compared to the classic integer linear programming method,the earliest deadline with weight first-maximum transfer time first heuristic scheduling algorithm is able to calculate a more optimal solution for the scheduling table of large-scale periodic traffic more swiftly.