Efficient Traffic Scheduling Using Genetic Algorithm in Time-Sensitive Networking

被引:0
|
作者
Su, Xiaoqian [1 ]
Tang, Chuhang [1 ]
Gong, Cheng [1 ]
机构
[1] Natl Univ Defense Technol, Coll Comp, Changsha, Peoples R China
关键词
Time-Sensitive Networking; industrial automation; Gate Control List; tabu search; genetic algorithm;
D O I
10.1109/ISCSIC57216.2022.00056
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
TSN (Time-Sensitive Networking) is promised to play an important role in industrial automation since more and more industrial environments need the support of time-sensitive networking technology to ensure real-time traffic transmission. In IEEE 802.1Qbv of TSN, the GCL (Gate Control List) calculation problem in TAS (Time Aware Shaper) is very critical. We refer to the time it takes for all real-time traffic to complete a cycle of transmission as Flowspan. The objective of a typical GCL calculation approach is to minimize Flowspan using tabu search. However, this method tends to a local optimal solution when the number of streams increases, resulting in a final solution that differs significantly from the global optimal solution. To address this problem, we proposed GAPER, a novel GCL calculation approach based on genetic algorithm with parent elite reservation in this paper. We conducted extensive experiments on DetNet. The experimental results show that our proposed GAPER has significant performance comparing with tabu search. In particular, when the number of flows reaches 20, the Flowspan derived by GAPER is 36.43% lower than the traditional method.
引用
收藏
页码:232 / 238
页数:7
相关论文
共 50 条
  • [1] A Hybrid Traffic Scheduling Strategy for Time-Sensitive Networking
    Pei, Jinchuan
    Hu, Yuxiang
    Tian, Le
    Li, Menglong
    Li, Ziyong
    [J]. ELECTRONICS, 2022, 11 (22)
  • [2] A Simple and Efficient Time-Sensitive Networking Traffic Scheduling Method for Industrial Scenarios
    Li, Qing
    Li, Dong
    Jin, Xi
    Wang, Qizhao
    Zeng, Peng
    [J]. ELECTRONICS, 2020, 9 (12) : 1 - 19
  • [3] An Efficient Time-Sensitive Networking Traffic Scheduling Method for Train Communication Network
    Zhu, Guangchao
    Nie, Xiaobo
    Li, Yangtao
    Ma, Ke
    Yang, Yueyi
    [J]. IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING, 2024,
  • [4] Genetic Algorithm for Scheduling Time-Triggered Traffic in Time-Sensitive Networks
    Pahlevan, Maryam
    Obermaisser, Roman
    [J]. 2018 IEEE 23RD INTERNATIONAL CONFERENCE ON EMERGING TECHNOLOGIES AND FACTORY AUTOMATION (ETFA), 2018, : 337 - 344
  • [5] Time-Aware Traffic Scheduling with Virtual Queues in Time-Sensitive Networking
    Xue, Junli
    Shou, Guochu
    Liu, Yaqiong
    Hu, Yihong
    Guo, Zhigang
    [J]. 2021 IFIP/IEEE INTERNATIONAL SYMPOSIUM ON INTEGRATED NETWORK MANAGEMENT (IM 2021), 2021, : 604 - 607
  • [6] Resource-Aware Online Traffic Scheduling for Time-Sensitive Networking
    Hong, Xinyi
    Xi, Yuhao
    Liu, Peng
    [J]. IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2024,
  • [7] Hybrid traffic scheduling in time-sensitive networking for the support of automotive applications
    Nie, Hongrui
    Su, Yue
    Zhao, Weibo
    Mu, Junsheng
    [J]. IET COMMUNICATIONS, 2024, 18 (02) : 111 - 128
  • [8] Design and Implementation of Traffic Scheduling Algorithm for Time-Sensitive Network
    Wang, Ye
    Wang, Fushen
    Wang, Wei
    Tan, Xiaowen
    Wen, Jiachen
    Wang, Ying
    Lin, Peng
    [J]. 2022 IEEE INTERNATIONAL SYMPOSIUM ON BROADBAND MULTIMEDIA SYSTEMS AND BROADCASTING (BMSB), 2022,
  • [9] TSN-Peeper: an Efficient Traffic Monitor in Time-Sensitive Networking
    Zhang, Chuwen
    Zhou, Boyang
    Tian, Zerui
    Cheng, Liang
    Liu, Yuxi
    Zhang, Huayu
    Chen, Song
    Wan, Ying
    Xu, Wenquan
    Pan, Tian
    Xu, Yang
    Wang, Yi
    Zhu, Hailong
    Liu, Bin
    [J]. 2022 IEEE 30TH INTERNATIONAL CONFERENCE ON NETWORK PROTOCOLS (ICNP 2022), 2022,
  • [10] Flow Ordering Problem for Time-Triggered Traffic in the Scheduling of Time-Sensitive Networking
    Chen, Zhuoxing
    Lu, Yiqin
    Wang, Haihan
    Qin, Jiancheng
    Wang, Meng
    [J]. IEEE COMMUNICATIONS LETTERS, 2023, 27 (05) : 1367 - 1371