Decentralized Dynamic Scheduling of TCPS Flows and a Simulator for Time-sensitive Networking

被引:1
|
作者
Polachan, Kurian [1 ]
Singh, Chandramani [2 ]
Prabhakar, T., V [2 ]
机构
[1] Indian Inst Sci, Bangalore, Karnataka, India
[2] Indian Inst Sci, Dept Elect Syst Engn, Bangalore 560012, Karnataka, India
关键词
Time-sensitive networking; Time-Aware Shaper; tactile internet; Tactile Cyber-Physical Systems; network simulator; HAPTIC COMMUNICATIONS;
D O I
10.1145/3498729
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cybersickness and control-loop instabilities are two main concerns in Tactile Cyber-Physical Systems (TCPS). TCPS applications demand stringent bounds on end-to-end latencies to avoid their occurrences. Traditional best-effort networks cannot guarantee packet latencies in the presence of external traffic. However, emerging deterministic networks such as IEEE 802.1 Time-Sensitive Networking (TSN) can isolate time-critical flows from external traffic using IEEE 802.1Qbv Time-Aware Shaper (TAS) to guarantee bounded end-to-end packet latencies. In this work, we develop eDDSCH-TSN, a decentralized dynamic scheduling protocol to configure non-overlapping gate slots in TAS-enabled TSN switches to support TCPS flows. eDDSCH-TSN supports plug-and-play operation of compatible TCPS terminals with guaranteed minimal end-to-end packet latencies. Compared to the state-of-the-art, eDDSCH-TSN provides three orders lower end-to-end packet latencies for TCPS flows in mid-size networks with 10 hops between source and destination terminals. Further, we also present PYTSN, an open-source discrete-event TSN simulator that we use for evaluating eDDSCH-TSN. In particular, we use PYTSN to show the isolation of TCPS flows from external traffic and plug-and-play operation of TCPS terminals.
引用
收藏
页数:30
相关论文
共 50 条
  • [1] Enhanced Real-time Scheduling of AVB Flows in Time-Sensitive Networking
    Deng, Libing
    Zeng, Gang
    Kurachi, Ryo
    Takada, Hiroaki
    Xiao, Xiongren
    Li, Renfa
    Xie, Guoqi
    ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2024, 29 (02)
  • [2] Survey on Traffic Scheduling in Time-Sensitive Networking
    Zhang T.
    Feng J.
    Ma Y.
    Qu S.
    Ren F.
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2022, 59 (04): : 747 - 764
  • [3] A Hybrid Traffic Scheduling Strategy for Time-Sensitive Networking
    Pei, Jinchuan
    Hu, Yuxiang
    Tian, Le
    Li, Menglong
    Li, Ziyong
    ELECTRONICS, 2022, 11 (22)
  • [4] Time-Triggered Scheduling for Time-Sensitive Networking with Preemption
    Zhou, Yuanbin
    Samii, Soheil
    Eles, Petru
    Peng, Zebo
    27TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, ASP-DAC 2022, 2022, : 262 - 267
  • [5] An efficient scheduling approach for multi-level industrial chain flows in time-sensitive networking
    Gong, Kai
    Yang, Dong
    Zhang, Weiting
    Ren, Jie
    COMPUTER NETWORKS, 2023, 221
  • [6] Dependability-aware routing and scheduling for Time-Sensitive Networking
    Reusch, Niklas
    Craciunas, Silviu S.
    Pop, Paul
    IET CYBER-PHYSICAL SYSTEMS: THEORY & APPLICATIONS, 2022, 7 (03) : 124 - 146
  • [7] Security-Aware Scheduling Method for Time-Sensitive Networking
    Lu Y.
    Xie W.
    Wang H.
    Chen Z.
    Cheng Z.
    Pan W.
    Qin J.
    Huanan Ligong Daxue Xuebao/Journal of South China University of Technology (Natural Science), 2023, 51 (05): : 1 - 12
  • [8] Bandwidth Partitioning for Time-Sensitive Networking Flows in Automotive Communications
    Leonardi, Luca
    Bello, Lucia Lo
    Patti, Gaetano
    IEEE COMMUNICATIONS LETTERS, 2021, 25 (10) : 3258 - 3261
  • [9] Time-Aware Traffic Scheduling with Virtual Queues in Time-Sensitive Networking
    Xue, Junli
    Shou, Guochu
    Liu, Yaqiong
    Hu, Yihong
    Guo, Zhigang
    2021 IFIP/IEEE INTERNATIONAL SYMPOSIUM ON INTEGRATED NETWORK MANAGEMENT (IM 2021), 2021, : 604 - 607
  • [10] SSA:CQF-oriented Scheduling Algorithm in Time-Sensitive Networking
    Jiang X.-Y.
    Yan J.-L.
    Quan W.
    Sun Z.-G.
    Dongbei Daxue Xuebao/Journal of Northeastern University, 2020, 41 (06): : 784 - 791