Optimizing Fault-Tolerant Time-Aware Flow Scheduling in TSN-5G Networks

IF 7.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Guizhen Li;Shuo Wang;Yudong Huang;Tao Huang;Yuanhao Cui;Zehui Xiong
{"title":"Optimizing Fault-Tolerant Time-Aware Flow Scheduling in TSN-5G Networks","authors":"Guizhen Li;Shuo Wang;Yudong Huang;Tao Huang;Yuanhao Cui;Zehui Xiong","doi":"10.1109/TMC.2024.3510604","DOIUrl":null,"url":null,"abstract":"The integration of time-sensitive networking (TSN) and fifth-generation (5G) offers a promising solution for real-time and reliable data transmission in the Industrial Internet of Things (IIoT). However, current research focuses on traffic scheduling in TSN-5G networks to support low latency. New challenges arise when TSN-5G networks leverage time-aware shaper (TAS) and frame replication and elimination for reliability (FRER) to achieve low latency and high reliability. Simply combining TAS and FRER (SCTF) requires scheduling all time-triggered (TT) flows and their replica flows, which substantially increases the computational complexity of gate control lists (GCLs) and severely weakens scheduling capabilities. Moreover, the packet elimination function (PEF) in FRER may induce packet misordering. In this paper, we propose an efficient and fault-tolerant time-aware shaper (EF-TAS) mechanism for TSN-5G networks. EF-TAS only allocates timeslots for TT flows, while replica TT (RT) flows are delivered using a best-effort strategy. Due to the potential violation of deadlines in RT flows, we design an adaptive cyclic GCL window (ACGW)-based hybrid scheduling (AHS) algorithm to schedule TT and RT flows differentially. The AHS algorithm utilizes network calculus to ensure the timely arrival of RT flows without affecting the deterministic transmission of TT flows. In particular, we provide upper bounds on the amount of reordering to quantify the disorder caused by PEF and analyze the impact of introducing the packet ordering function (POF) on EF-TAS performance. The evaluation results show that EF-TAS not only meets the reliability and deadline requirements but also significantly reduces the total number of GCL entries and the computation time of GCLs compared to state-of-the-art methods.","PeriodicalId":50389,"journal":{"name":"IEEE Transactions on Mobile Computing","volume":"24 4","pages":"3441-3455"},"PeriodicalIF":7.7000,"publicationDate":"2024-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Mobile Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10780973/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

The integration of time-sensitive networking (TSN) and fifth-generation (5G) offers a promising solution for real-time and reliable data transmission in the Industrial Internet of Things (IIoT). However, current research focuses on traffic scheduling in TSN-5G networks to support low latency. New challenges arise when TSN-5G networks leverage time-aware shaper (TAS) and frame replication and elimination for reliability (FRER) to achieve low latency and high reliability. Simply combining TAS and FRER (SCTF) requires scheduling all time-triggered (TT) flows and their replica flows, which substantially increases the computational complexity of gate control lists (GCLs) and severely weakens scheduling capabilities. Moreover, the packet elimination function (PEF) in FRER may induce packet misordering. In this paper, we propose an efficient and fault-tolerant time-aware shaper (EF-TAS) mechanism for TSN-5G networks. EF-TAS only allocates timeslots for TT flows, while replica TT (RT) flows are delivered using a best-effort strategy. Due to the potential violation of deadlines in RT flows, we design an adaptive cyclic GCL window (ACGW)-based hybrid scheduling (AHS) algorithm to schedule TT and RT flows differentially. The AHS algorithm utilizes network calculus to ensure the timely arrival of RT flows without affecting the deterministic transmission of TT flows. In particular, we provide upper bounds on the amount of reordering to quantify the disorder caused by PEF and analyze the impact of introducing the packet ordering function (POF) on EF-TAS performance. The evaluation results show that EF-TAS not only meets the reliability and deadline requirements but also significantly reduces the total number of GCL entries and the computation time of GCLs compared to state-of-the-art methods.
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Mobile Computing
IEEE Transactions on Mobile Computing 工程技术-电信学
CiteScore
12.90
自引率
2.50%
发文量
403
审稿时长
6.6 months
期刊介绍: IEEE Transactions on Mobile Computing addresses key technical issues related to various aspects of mobile computing. This includes (a) architectures, (b) support services, (c) algorithm/protocol design and analysis, (d) mobile environments, (e) mobile communication systems, (f) applications, and (g) emerging technologies. Topics of interest span a wide range, covering aspects like mobile networks and hosts, mobility management, multimedia, operating system support, power management, online and mobile environments, security, scalability, reliability, and emerging technologies such as wearable computers, body area networks, and wireless sensor networks. The journal serves as a comprehensive platform for advancements in mobile computing research.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信