电信科学 ›› 2024, Vol. 40 ›› Issue (2): 22-37.doi: 10.11959/j.issn.1000-0801.2024009

• 研究与开发 • 上一篇    

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

李传煌1,2, 廖君虎1, 宣家栋1, 徐琪2, 张慧峰2, 朱俊2, 邹涛2, 张汝云2   

  1. 1 浙江工商大学信息与电子工程学院(萨塞克斯人工智能学院),浙江 杭州 310018
    2 之江实验室,浙江 杭州 311121
  • 修回日期:2024-01-11 出版日期:2024-02-01 发布日期:2024-02-01
  • 作者简介:李传煌(1980- ),男,博士,浙江工商大学教授、硕士生导师,之江实验室双聘专家,主要研究方向为新一代网络技术、边缘计算、人工智能应用
    廖君虎(1998- ),男,浙江工商大学硕士生,主要研究方向为软件定义网络、移动网络优先等
    宣家栋(1998- ),男,硕士,浙江工商大学毕业生,主要研究方向为软件定义网络、时间敏感网络等
    徐琪(1992- ),男,博士,之江实验室副研究员,主要研究方向为多模态网络、软件定义网络、时间敏感网络等
    张慧峰(1992- ),女,博士,之江实验室助理研究员,主要研究方向为多模态网络、新型网络拓扑结构、时间敏感网络等
    朱俊(1981- ),男,博士,之江实验室高级工程师,主要研究方向为新型网络架构、软件定义网络、网络管理与控制技术、网络协议设计与优化、卫星网络等
    邹涛(1974- ),男,博士,之江实验室研究员,主要研究方向为多模态网络技术和新型网络体系架构
    张汝云(1973- ),男,博士,之江实验室研究员,主要研究方向为多模态网络技术、工业互联网和网络通信安全
  • 基金资助:
    国家自然科学基金资助项目(U22A2005);国家自然科学基金资助项目(61871468);国家自然科学基金资助项目(62111540270);之江实验室科研攻关项目(2021LE0AC02);“慧眼行动”资助项目(D4DAC0D6);浙江省自然科学基金资助项目(LZ23F010003);浙江省自然科学基金资助项目(LQ23F010009);浙江省新型网络标准与应用技术重点实验室资助项目(2013E10012)

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

Chuanhuang LI1,2, Junhu LIAO1, Jiadong XUAN1, Qi XU2, Huifeng ZHANG2, Jun ZHU2, Tao ZOU2, Ruyun ZHANG2   

  1. 1 School of Information and Electronic Engineering (Sussex Artificial Intelligence Institute), Zhejiang Gongshang University, Hangzhou 310018, China
    2 Zhejiang Lab, Hangzhou 311121, China
  • Revised:2024-01-11 Online:2024-02-01 Published:2024-02-01
  • Supported by:
    The National Natural Science Foundation of China(U22A2005);The National Natural Science Foundation of China(61871468);The National Natural Science Foundation of China(62111540270);The Key Research Project of Zhejiang Lab(2021LE0AC02);“Operation Wise Eyes” Project(D4DAC0D6);The Zhejiang Provincial Natural Science Foundation(LZ23F010003);The Zhejiang Provincial Natural Science Foundation(LQ23F010009);Zhejiang Provincial Key Laboratory of New Network Standards and Technologies (NNST)(2013E10012)

摘要:

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

关键词: 时间敏感网络, 周期性流量, 流量调度, 启发式算法, 回溯法

Abstract:

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.

Key words: time-sensitive network, periodic traffic, traffic scheduling, heuristic algorithm, backtracking algorithm

中图分类号: 

No Suggested Reading articles found!