计算机科学 ›› 2025, Vol. 52 ›› Issue (6A): 240800090-6.doi: 10.11896/jsjkx.240800090

• 网络&通信 • 上一篇    下一篇

一种基于贪婪的时间敏感网络增量路由调度方法

周飞飞1, 马涛1, 付振霄2, 朱云飞1, 虞扬3   

  1. 1 国网电力科学研究院有限公司 南京 210096
    2 国网山东省电力公司经济技术研究院 济南 250001
    3 南京邮电大学通信与信息工程学院 南京 210003
  • 出版日期:2025-06-16 发布日期:2025-06-12
  • 通讯作者: 周飞飞(zhfly@mail.ustc.edu.cn)
  • 基金资助:
    国家电网公司总部科技项目:电力时间敏感网络交换芯片研制与应用(5108-202218280A-2-170-XG)

Incremental Routing and Scheduling Based on Greedy in TSN

ZHOU Feifei1, MA Tao1, FU Zhenxiao2, ZHU Yunfei1, YU Yang3   

  1. 1 State Grid Electric Power Research Institute,Nari Group Co.,Ltd.,Nanjing 210096,China
    2 Economic&Technology Research Institute,State Grid Shandong Electric Power Company,Jinan 250001,China
    3 School of Communications and Information Engineering,Nanjing University of Posts and Telecommunications,Nanjing 210003,China
  • Online:2025-06-16 Published:2025-06-12
  • About author:ZHOU Feifei,born in 1986,master,seniorengineer.His main research interests include new power communication system,FlexE technology and time sensitive network technology.
  • Supported by:
    Science and Technology Project of State Grid Corporation Headquarters:Development and Application of Power Time-Sensitive Network Switching Chip(5108-202218280A-2-170-XG).

摘要: 目前,现代工业的发展对智能电网、智能驾驶等领域的网络传输时延和可靠性提出了很高的要求。为了应对这些挑战,IEEE 802.1TSN工作组提出了时间敏感网络(TSN)的概念。其中,以循环排队转发(CQF)作为传输机制的时间敏感网络模型在确定性网络研究领域受到广泛关注,但关于流量的路由选择和调度问题仍是一个非常关键的任务。利用相关的流量特性,提出了一种基于贪婪和Dijkstra算法的增量路由选择方案,并将其与负载均衡的时隙偏移量选择进行结合,得到一种联合路由调度方案,用于解决多路由场景下复杂流量的路由-调度问题。在仿真方面,建立TSN网络拓扑模型并进行多次实验验证。结果证明,提出的方案对比传统的贪婪和禁忌搜索算法,在时间消耗和调度成功率上都有着较为明显的优势。

关键词: 时间敏感网络, 循环排队转发, 路由, 调度, 贪婪算法

Abstract: The development of modern industries,such as smart grid and intelligent driving,imposes stringent demands on network transmission delay and reliability.To tackle these challenges,the IEEE 802.1TSN working group proposes the concept of time-sensitive networks(TSN).Among them,the time-sensitive network model with cyclic queued forwarding(CQF) as the transmission mechanism has garnered significant attention in deterministic network research.However,traffic routing and sche-duling remain critical tasks that need to be addressed.This paper proposes an incremental routing selection scheme based on the greedy algorithm and Dijkstra’s algorithm,leveraging relevant traffic characteristics.This scheme is further integrated with load-balanced time slot offset selection to develop a joint routing and scheduling scheme, addressing the routing-scheduling challenges posed by complex traffic flows in multi-path scenarios.In terms of simulation,a TSN network topology model is established and verified through numerous experiments.The results demonstrate that,compared to traditional greedy and tabu search algorithms,the proposed scheme exhibits notable advantages in terms of time consumption and scheduling success rate.

Key words: TSN, CQF, Routing, Scheduling, Greedy algorithm

中图分类号: 

  • TN915
[1]BRUCKNER D.An introduction to OPC UA TSN for industrial communication systems[J].Proceedings of the IEEE,2019,107(6):1121-1131.
[2]VLK M,HANZÁLEK Z,BREJCHOVÁA K,et al.Enhancingschedulability and throughput of time-triggered flows in IEEE 802.1qbv time-sensitive networks[J].IEEE Transactions on Communications,2020,68(11):7023-7038.
[3]FEDULLO T,MORATO A,TRAMARIN F,et al.A comprehensive review on time sensitive networks with a special focus on its applicability to industrial smart and distributed measurement systems[J].Sensors,2022,22(1638).
[4]SEOL Y,HYEON D,MIN J,et al.Timely survey of time-sensitive networking:Past and future directions[J].IEEE Access,2021,9:142506-142527.
[5]ISO/IEC/IEEE International Standard-nformation Technolo-gy-Telecommunications and Information Exchange Between Systems-Local and Metropolitan Area Networks-Specific Requirements-Part 1Q:Bridges and Bridged Networks Amendment 3:Enhancements for Scheduled Traffic[Z].
[6]IEEE/ISO/IEC International Standard-Information Technology-Telecommunications and Information Exchange Between Systems-Local and Metropolitan Area Networks-Specific Requirements-Part 1Q:Bridges and Bridged Networks-Amendment 7:Cyclic Queuing and Forwarding[Z].
[7]CRACIUNAS S S,OLIVER R S,CHMELÍK M,et al.Scheduling real-time communication in IEEE 802.1qbv time sensitive networks[C]//Proc.Int.Conf.Real-time Netw.Syst..2016:183-192.
[8]POP P,RAAGAARD M L,CRACIUNAS S S,et al.Design optimisation of cyber-physical distributed systems using IEEE time-sensitive networks[J].IET Cyber-Physical Systems:Theory & Applications,2016,1:86-94.
[9]DÜRR F,NAYAK N G.No-wait packet scheduling for IEEEtime-sensitive networks(TSN)[C]//Proc.24th Int.Conf.Real-Time Networks and Systems.Brest,France,2016:203-212.
[10]TAN W,WU B.Long-distance deterministic transmissionamong tsn networks:Convergingn cqf and dip[C]//2021 IEEE 29th International Conference on Network Protocols(ICNP).Dallas,TX,USA,2021:1-6.
[11]YAN J,QUAN W,JIANG X,et al.Injection time planning:Making cqf practical in timesensitive networking[C]//IEEE INFOCOM 2020-IEEE Conference on Computer Communications.Toronto,Canada,2020:616-625.
[12]HUANG Y,WANG S,ZHANG X,et al.Flexible cyclic queuing and forwarding for time-sensitive software-defined networks[J].IEEE Transactions on Network and Service Management,2023,20(1):533-546.
[13]YANG D,CHENG Z,ZHANG W,et al.Burstaware time-triggered flow scheduling with enhanced multi-cqf in time-sensitive networks[J].IEEE/ACM Transactions on Networking,2023,31(6):2809-2824.
[14]GUO M,GU C,HE S,et al.Mss:Exploiting mapping score for cqf start time planning in time-sensitive networking[J].IEEE Transactions on Industrial Informatics,2023,19(2):2140-2150.
[15]WANG X,YAO H,MAI T,et al.Joint routing and scheduling with cyclic queuing and forwarding for time-sensitive networks[J].IEEE Transactions on Vehicular Technology,2023,72(3):3793-3804.
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!