FastTS: Enabling Fault-Tolerant and Time-Sensitive Scheduling in Space-Terrestrial Integrated Networks

被引:0
|
作者
Peng, Guoyu [1 ]
Wang, Shuo [1 ,2 ]
Huang, Tao [1 ,2 ]
Li, Fengtao [1 ]
Zhao, Kangzhe [1 ]
Huang, Yudong [1 ]
Xiong, Zehui [3 ]
机构
[1] Beijing Univ Posts & Telecommun BUPT, State Key Lab Networking & Switching Technol, Beijing 100876, Peoples R China
[2] Purple Mt Labs, Future Network Res Ctr, Nanjing 211111, Peoples R China
[3] Singapore Univ Technol & Design SUTD, Pillar Informat Syst Technol & Design, Singapore 487372, Singapore
基金
中国国家自然科学基金;
关键词
Delays; Routing; Reliability; Satellites; Redundancy; Fault tolerant systems; Topology; Space-terrestrial communications; multipath redundancy; time-sensitive networking; time-variant routing; SATELLITE NETWORKS; LOW LATENCY; DELAY;
D O I
10.1109/JSAC.2024.3459008
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The emerging space-terrestrial integrated network (STIN) assumes a pivotal role within the 6G vision, promising to deliver seamless global coverage and connectivity. Achieving advanced, high-reliability, and time-sensitive (TS) services in a resource-constrained and failure-prone space environment is critical, but also presents challenges. Existing space-terrestrial communication approaches either suffer from temporary link failures with unstable reliability, or intolerable service latency due to the extensive coverage and uneven traffic distribution. This paper presents FastTS, a heuristic resilient and performant scheduling strategy to achieve fault-tolerant and time-sensitive scheduling in futuristic STINs. First, we model the high-dynamic and failure-prone topology in space, and formulate the scheduling problem as a mixed non-linear problem with the objective of minimizing the average task completion time. To approach the optimal solution, joint time-variant routing and frame replication and elimination for reliability (FRER) redundancy under resource constraints are formally considered in our design. During the path-stable duration, FastTS prioritizes the multipath selection with higher redundancy scores, all while ensuring a bounded low latency for TS services based on time-sensitive networking (TSN) techniques. Specifically, our FastTS is divided into three phases: time-sensitive multipath generation (TMG), series-parallel redundancy scoring (SPRS), and SPRS-based time-variant routing (STR). Finally, simulation results show that FastTS exhibits outstanding performance improvements in terms of packet delay, scheduling success ratio, task completion time and packet loss rate, when compared to other state-of-the-art methods.
引用
收藏
页码:3551 / 3565
页数:15
相关论文
共 50 条
  • [21] Joint Routing and Scheduling for Dynamic Applications in Multicast Time-Sensitive Networks
    Li, Cong
    Zhang, Chenyu
    Zheng, Wei
    Wen, Xiangming
    Lu, Zhaoming
    Zhao, Jiawen
    2021 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC WORKSHOPS), 2021,
  • [22] Online Scheduling for Dynamic VM Migration in Multicast Time-Sensitive Networks
    Yu, Qinghan
    Wan, Hai
    Zhao, Xibin
    Gao, Yue
    Gu, Ming
    IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2020, 16 (06) : 3778 - 3788
  • [23] Constraint programming approaches to joint routing and scheduling in time-sensitive networks
    Vlk, Marek
    Hanzalek, Zdenek
    Tang, Siyu
    COMPUTERS & INDUSTRIAL ENGINEERING, 2021, 157
  • [24] Fault-Tolerant Real-Time Fair Scheduling on Multiprocessor Systems with Cold-Standby
    Nair, Piyoosh Purushothaman
    Sarkar, Arnab
    Biswas, Santosh
    IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING, 2021, 18 (04) : 1718 - 1732
  • [25] Enhancing Reliability of Time-Triggered Traffic in Joint Scheduling and Routing Optimization Within Time-Sensitive Networks
    Akram, Bilal Omar
    Kamariah Noordin, Nor
    Hashim, Fazirulhisyam
    Fadlee Rasid, Mohd A.
    Ismael Salman, Mustafa
    Abdulghani, Abdulrahman M.
    IEEE ACCESS, 2024, 12 : 78379 - 78396
  • [26] Optimal Scheduling of Time-Sensitive Networks for Automotive Ethernet Based on Genetic Algorithm
    Kim, Hyeong-Jun
    Lee, Kyung-Chang
    Kim, Man-Ho
    Lee, Suk
    ELECTRONICS, 2022, 11 (06)
  • [27] Automated Root Cause Analysis in Time-Sensitive Networks based on Fault Models
    Ferfers, Tobias
    Schriegel, Sebastian
    Jasperneite, Juergen
    2023 IEEE INTERNATIONAL SYMPOSIUM ON PRECISION CLOCK SYNCHRONIZATION FOR MEASUREMENT, CONTROL, AND COMMUNICATION, ISPCS, 2023,
  • [28] Hybrid Traffic Scheduling in 5G and Time-Sensitive Networking Integrated Networks for Communications of Virtual Power Plants
    Wu, Junmin
    Liu, Chuan
    Tao, Jing
    Liu, Shidong
    Gao, Wei
    APPLIED SCIENCES-BASEL, 2023, 13 (13):
  • [29] Replica fault-tolerant scheduling with time guarantee under energy constraint in fog computing
    Liu, Ruihua
    Wu, Wufei
    Guo, Xiaochuan
    Zeng, Gang
    Li, Keqin
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE, 2024, 159 : 567 - 579
  • [30] Reinforcement learning based routing for time-aware shaper scheduling in time-sensitive networks
    Min, Junhong
    Kim, Yongjun
    Kim, Moonbeom
    Paek, Jeongyeup
    Govindan, Ramesh
    COMPUTER NETWORKS, 2023, 235