TSN Network Scheduling-Challenges and Approaches

被引:4
作者
Chahed, Hamza [1 ]
Kassler, Andreas [1 ,2 ]
机构
[1] Karlstad Univ, Dept Comp Sci, S-65634 Karlstad, Sweden
[2] Deggendorf Inst Technol, Intelligent Networks & Syst, D-94469 Deggendorf, Germany
来源
NETWORK | 2023年 / 3卷 / 04期
关键词
Time-Sensitive Networking (TSN); scheduling; shaping; network configuration; Time-Aware Shaper (TAS); Cyclic Queuing and Forwarding (CQF); asynchronous traffic shaping (ATS); TIME-SENSITIVE NETWORKING; ALGORITHM; LATENCY; COMMUNICATION; OPTIMIZATION; PERFORMANCE;
D O I
10.3390/network3040026
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Time-Sensitive Networking (TSN) is a set of Ethernet standards aimed to improve determinism in packet delivery for converged networks. The main goal is to provide mechanisms that enable low and predictable transmission latency and high availability for demanding applications such as real-time audio/video streaming, automotive, and industrial control. To provide the required guarantees, TSN integrates different traffic shaping mechanisms including 802.1Qbv, 802.1Qch, and 802.1Qcr, allowing for the coexistence of different traffic classes with different priorities on the same network. Achieving the required quality of service (QoS) level needs proper selection and configuration of shaping mechanisms, which is difficult due to the diversity in the requirements of the coexisting streams under the presence of potential end-system-induced jitter. This paper discusses the suitability of the TSN traffic shaping mechanisms for the different traffic types, analyzes the TSN network configuration problem, i.e., finds the optimal path and shaper configurations for all TSN elements in the network to provide the required QoS, discusses the goals, constraints, and challenges of time-aware scheduling, and elaborates on the evaluation criteria of both the network-wide schedules and the scheduling algorithms that derive the configurations to present a common ground for comparison between the different approaches. Finally, we analyze the evolution of the scheduling task, identify shortcomings, and suggest future research directions.
引用
收藏
页码:585 / 624
页数:40
相关论文
共 129 条
  • [31] Scheduling Real-Time Communication in IEEE 802.1Qbv Time Sensitive Networks
    Craciunas, Silviu S.
    Oliver, Ramon Serna
    Chmelik, Martin
    Steiner, Wilfried
    [J]. PROCEEDINGS OF THE 24TH INTERNATIONAL CONFERENCE ON REAL-TIME NETWORKS AND SYSTEMS PROCEEDINGS (RTNS 2016), 2016, : 183 - 192
  • [32] Combined task- and network-level scheduling for distributed time-triggered systems
    Craciunas, Silviu S.
    Oliver, Ramon Serna
    [J]. REAL-TIME SYSTEMS, 2016, 52 (02) : 161 - 200
  • [33] Craciunas SS, 2014, 2014 IEEE EMERGING TECHNOLOGY AND FACTORY AUTOMATION (ETFA)
  • [34] Craciunas Silviu S., 2014, P 22 INT C REAL TIM, P45, DOI DOI 10.1145/2659787.2659812
  • [35] Fixed-Priority Scheduling and Controller Co-Design for Time-Sensitive Networks
    Dai, Xiaotian
    Zhao, Shuai
    Jiang, Yu
    Jiao, Xun
    Hu, Xiaobo Sharon
    Chang, Wanli
    [J]. 2020 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER AIDED-DESIGN (ICCAD), 2020,
  • [36] Dobrin R., 2019, P 4 INT WORKSH SEC D
  • [37] dos Santos ACT, 2019, 2019 FORMAL METHODS IN COMPUTER AIDED DESIGN (FMCAD), P69, DOI [10.23919/FMCAD.2019.8894249, 10.23919/fmcad.2019.8894249]
  • [38] No-wait Packet Scheduling for IEEE Time-sensitive Networks (TSN)
    Duerr, Frank
    Nayak, Naresh Ganesh
    [J]. PROCEEDINGS OF THE 24TH INTERNATIONAL CONFERENCE ON REAL-TIME NETWORKS AND SYSTEMS PROCEEDINGS (RTNS 2016), 2016, : 203 - 212
  • [39] Dustdar S., 2020, P 4 IEEE INT C EDG C, P1
  • [40] Time-Triggered Traffic Planning for Data Networks with Conflict Graphs
    Falk, Jonathan
    Durr, Frank
    Rothermel, Kurt
    [J]. 2020 IEEE REAL-TIME AND EMBEDDED TECHNOLOGY AND APPLICATIONS SYMPOSIUM (RTAS 2020), 2020, : 124 - 136