Dynamic stream partitioning for time-triggered traffic in Time-Sensitive Networking

被引:0
|
作者
Chen, Zhuoxing [1 ]
Lu, Yiqin [1 ]
Wang, Haihan [1 ]
Qin, Jiancheng [1 ]
Wang, Meng [1 ]
Pan, Weiqiang [1 ]
机构
[1] South China Univ Technol, Sch Elect & Informat Engn, Guangzhou 510640, Peoples R China
关键词
Deterministic communications; Time-Sensitive Networking; Scheduling; Time-triggered traffic; Stream partitioning; INDUSTRIAL COMMUNICATION; TSN; ETHERNET; LATENCY;
D O I
10.1016/j.comnet.2024.110492
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Time-Sensitive Networking (TSN) is a promising network technology that can ensure bounded latency jitter for industrial real-time scenarios. It establishes the IEEE 802.1 Qbv standard to precisely control periodic transmission time of the time-triggered (TT) traffic. However, it is still a challenge to efficiently schedule the TT traffic in large-scale networks with high transmission performance. In this paper, we propose a novel method called dynamic stream partitioning (DSP) to solve this problem. It satisfies the IEEE Qbv standard and can significantly reduce the scheduling time by reducing the number of constraints. on the DSP method, we analyze the impact of stream partitioning on the transmission performance of TT traffic, and propose an indicator called Normalized Degradation of Performance (NDOP) to quantify dynamically. Furthermore, we design a partitioning-aware dynamic routing (PADR) to expand the scheduling space. Integrated with NDOP and PADR, we propose a joint routing and dynamic stream partitioning (JR/DSP) algorithm. Extensive simulation experiments verify that the proposed JR/DSP algorithm has higher scalability, transmission performance, and schedulability compared to the static stream partitioning algorithms.
引用
收藏
页数:18
相关论文
共 50 条
  • [41] Assessing the traffic scheduling method for time-sensitive networking (TSN) by practical implementation
    Jiang, Junhui
    Li, Yuting
    Zhang, Xiongfeng
    Yu, Mengmeng
    Lee, Chang Dae
    Hong, Seung Ho
    JOURNAL OF INDUSTRIAL INFORMATION INTEGRATION, 2023, 33
  • [42] An Efficient Time-Sensitive Networking Traffic Scheduling Method for Train Communication Network
    Zhu, Guangchao
    Nie, Xiaobo
    Li, Yangtao
    Ma, Ke
    Yang, Yueyi
    IEEJ TRANSACTIONS ON ELECTRICAL AND ELECTRONIC ENGINEERING, 2024,
  • [43] Transmission Rate Scheduling and Stopping Time for Time-Sensitive Multicast Stream Traffic in Cellular Networks
    Tsai, Jung-Tsung
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2014, 13 (04) : 1754 - 1765
  • [44] Scheduling Time-Triggered Traffic in TTEthernet systems
    Suethanuwong, Ekarin
    2012 IEEE 17TH CONFERENCE ON EMERGING TECHNOLOGIES & FACTORY AUTOMATION (ETFA), 2012,
  • [45] Asynchronous Time-Aware Shaper for Time-Sensitive Networking
    Mate, Miklos
    Simon, Csaba
    Maliosz, Markosz
    JOURNAL OF NETWORK AND SYSTEMS MANAGEMENT, 2022, 30 (04)
  • [46] Coupling Source Routing with Time-Sensitive Networking
    Kumar, Gagan Nandha
    Katsalis, Kostas
    Papadimitriou, Panagiotis
    2020 IFIP NETWORKING CONFERENCE AND WORKSHOPS (NETWORKING), 2020, : 797 - 802
  • [47] Time-Sensitive Networking Experimentation on Open Testbeds
    Miranda, Gilson, Jr.
    Municio, Esteban
    Haxhibeqiri, Jetmir
    Macedo, Daniel F.
    Hoebeke, Jeroen
    Moerman, Ingrid
    Marquez-Barja, Johann M.
    IEEE INFOCOM 2022 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), 2022,
  • [48] Asynchronous Time-Aware Shaper for Time-Sensitive Networking
    Mate, Miklos
    Simon, Csaba
    Maliosz, Markosz
    PROCEEDINGS OF THE 2021 17TH INTERNATIONAL CONFERENCE ON NETWORK AND SERVICE MANAGEMENT (CNSM 2021): SMART MANAGEMENT FOR FUTURE NETWORKS AND SERVICES, 2021, : 565 - 571
  • [49] Asynchronous Time-Aware Shaper for Time-Sensitive Networking
    Miklós Máté
    Csaba Simon
    Markosz Maliosz
    Journal of Network and Systems Management, 2022, 30
  • [50] Scheduling time-sensitive IP traffic
    Sousa, P
    Carvalho, P
    Freitas, V
    MANAGEMENT OF MULTIMEDIA NETWORKS AND SERVICES, PROCEEDINGS, 2003, 2839 : 368 - 380