Online Routing and Scheduling for Time-Sensitive Networks

被引:9
|
作者
Huang, Yudong [1 ]
Wang, Shuo [1 ,2 ]
Huang, Tao [1 ,2 ]
Wu, Binwei [2 ]
Wu, Yunxiang [2 ]
Liu, Yunjie [1 ,2 ]
机构
[1] BUPT, State Key Lab Networking & Switching Technol, Beijing, Peoples R China
[2] Purple Mt Labs, Nanjing, Peoples R China
基金
北京市自然科学基金; 中国国家自然科学基金; 国家重点研发计划;
关键词
Time-Sensitive Networks; Online Routing and Scheduling; Time-Aware Shaper;
D O I
10.1109/ICDCS51616.2021.00034
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Recent proposals leverage Time-Aware Shaper (TAS) to achieve precise transmission in Time-Sensitive Networking (TSN). However, most of the proposals require the information of all time-triggered flows to be known in advance and synthesize the gate control list of each switch offline, making the mechanisms they designed inapplicable to industrial automation scenarios where the devices are changed dynamically and the flows should be scheduled online. In this paper, we propose an online routing and scheduling mechanism of TAS for time-sensitive networks. In order to maximize the number of schedulable flows and reduce bandwidth waste, we devise the variable time slot mechanism and minimize the sending start time of each flow. Based on these mechanisms, a novel incremental routing and scheduling (IRAS) algorithm is designed to achieve per-flow deployment, with a pre-routing algorithm to reduce synthesis time. The evaluations show that the IRAS algorithm approaches 96.5% of the optimal solution in scheduling 2000 flows, and has a feasible per-flow computational time from sub-seconds to less than ten seconds.
引用
收藏
页码:272 / 281
页数:10
相关论文
共 50 条
  • [31] Failure Handling for Time-Sensitive Networks using SDN and Source Routing
    Kumar, Gagan Nandha
    Katsalis, Kostas
    Papadimitriou, Panagiotis
    Pop, Paul
    Carle, Georg
    [J]. PROCEEDINGS OF THE 2021 IEEE 7TH INTERNATIONAL CONFERENCE ON NETWORK SOFTWARIZATION (NETSOFT 2021): ACCELERATING NETWORK SOFTWARIZATION IN THE COGNITIVE AGE, 2021, : 226 - 234
  • [32] An Efficient Hypergraph-Based Routing Algorithm in Time-Sensitive Networks
    Lu, Yinzhi
    Zhao, Guofeng
    Xu, Chuan
    Yu, Shui
    [J]. IEEE SIGNAL PROCESSING LETTERS, 2024, 31 : 835 - 839
  • [33] 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
  • [34] Weighted Scheduling of Time-Sensitive Coflows
    Brun, Olivier
    El-Azouzi, Rachid
    Luu, Quang-Trung
    De Pellegrini, Francesco
    Prabhu, Balakrishna J.
    Richier, Cedric
    [J]. IEEE TRANSACTIONS ON CLOUD COMPUTING, 2024, 12 (02) : 644 - 658
  • [35] 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
  • [36] Scheduling time-sensitive IP traffic
    Sousa, P
    Carvalho, P
    Freitas, V
    [J]. MANAGEMENT OF MULTIMEDIA NETWORKS AND SERVICES, PROCEEDINGS, 2003, 2839 : 368 - 380
  • [37] Routing and Scheduling for Low Latency and Reliability in Time-Sensitive Software-Defined IIoT
    Ji, Luyue
    He, Shibo
    Gu, Chaojie
    Shi, Zhiguo
    Chen, Jiming
    [J]. IEEE INTERNET OF THINGS JOURNAL, 2024, 11 (07) : 12929 - 12940
  • [38] Topic based time-sensitive influence maximization in online social networks
    Huiyu Min
    Jiuxin Cao
    Tangfei Yuan
    Bo Liu
    [J]. World Wide Web, 2020, 23 : 1831 - 1859
  • [39] Topic based time-sensitive influence maximization in online social networks
    Min, Huiyu
    Cao, Jiuxin
    Yuan, Tangfei
    Liu, Bo
    [J]. WORLD WIDE WEB-INTERNET AND WEB INFORMATION SYSTEMS, 2020, 23 (03): : 1831 - 1859
  • [40] Coupling Source Routing with Time-Sensitive Networking
    Kumar, Gagan Nandha
    Katsalis, Kostas
    Papadimitriou, Panagiotis
    [J]. 2020 IFIP NETWORKING CONFERENCE AND WORKSHOPS (NETWORKING), 2020, : 797 - 802