时间敏感网络中支持抢占的时间感知整形器的可调度性分析

IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Feng Luo , Lei Zhu , Zitong Wang , Haotian Gan , Yunpeng Li , Zhenyu Yang , Dengcheng Liu
{"title":"时间敏感网络中支持抢占的时间感知整形器的可调度性分析","authors":"Feng Luo ,&nbsp;Lei Zhu ,&nbsp;Zitong Wang ,&nbsp;Haotian Gan ,&nbsp;Yunpeng Li ,&nbsp;Zhenyu Yang ,&nbsp;Dengcheng Liu","doi":"10.1016/j.comnet.2025.111424","DOIUrl":null,"url":null,"abstract":"<div><div>To establish a unified networking technology for time- and safety-critical applications such as industrial control systems, the Time-Sensitive Networking (TSN) Working Group has proposed a series of protocols that introduce new features for TSN-enabled switches and end stations. Notably, the IEEE 802.1Qbv and Qbu standards incorporate the Time-Aware Shaper (TAS) and frame preemption mechanisms, which collectively provide low-latency guarantees for time-sensitive traffic. Deterministic communication constitutes a fundamental requirement for real-time critical systems. However, jitter at end stations remains unavoidable under certain circumstances. This necessitates the establishment of worst-case latency bounds for all network flows. Against this background, this paper presents a formal timing analysis method for TAS networks with preemption under different configurations. The proposed methodology is subsequently refined by accounting for the impacts of multi-hop architectures. Finally, a scheduler is built to determine the delay upper bound and the performance of this approach is validated through comparative evaluations with OMNeT++ simulation results across three distinct scenarios.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"269 ","pages":"Article 111424"},"PeriodicalIF":4.6000,"publicationDate":"2025-05-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Schedulability analysis of time aware shaper with preemption supported in time-sensitive networks\",\"authors\":\"Feng Luo ,&nbsp;Lei Zhu ,&nbsp;Zitong Wang ,&nbsp;Haotian Gan ,&nbsp;Yunpeng Li ,&nbsp;Zhenyu Yang ,&nbsp;Dengcheng Liu\",\"doi\":\"10.1016/j.comnet.2025.111424\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>To establish a unified networking technology for time- and safety-critical applications such as industrial control systems, the Time-Sensitive Networking (TSN) Working Group has proposed a series of protocols that introduce new features for TSN-enabled switches and end stations. Notably, the IEEE 802.1Qbv and Qbu standards incorporate the Time-Aware Shaper (TAS) and frame preemption mechanisms, which collectively provide low-latency guarantees for time-sensitive traffic. Deterministic communication constitutes a fundamental requirement for real-time critical systems. However, jitter at end stations remains unavoidable under certain circumstances. This necessitates the establishment of worst-case latency bounds for all network flows. Against this background, this paper presents a formal timing analysis method for TAS networks with preemption under different configurations. The proposed methodology is subsequently refined by accounting for the impacts of multi-hop architectures. Finally, a scheduler is built to determine the delay upper bound and the performance of this approach is validated through comparative evaluations with OMNeT++ simulation results across three distinct scenarios.</div></div>\",\"PeriodicalId\":50637,\"journal\":{\"name\":\"Computer Networks\",\"volume\":\"269 \",\"pages\":\"Article 111424\"},\"PeriodicalIF\":4.6000,\"publicationDate\":\"2025-05-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1389128625003913\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128625003913","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

为了为工业控制系统等时间和安全关键应用建立统一的网络技术,时间敏感网络(TSN)工作组提出了一系列协议,为启用TSN的交换机和端站引入了新功能。值得注意的是,IEEE 802.1Qbv和Qbu标准结合了时间感知形状器(Time-Aware Shaper, TAS)和帧抢占机制,它们共同为时间敏感型流量提供了低延迟保证。确定性通信是实时关键系统的基本要求。然而,在某些情况下,端站的抖动仍然是不可避免的。这就需要为所有网络流建立最坏情况延迟边界。在此背景下,本文提出了不同配置下具有抢占的TAS网络的形式化时序分析方法。随后,通过考虑多跳架构的影响,改进了所提出的方法。最后,构建了一个调度器来确定延迟上限,并通过与三种不同场景的omnet++仿真结果的比较评估来验证该方法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Schedulability analysis of time aware shaper with preemption supported in time-sensitive networks
To establish a unified networking technology for time- and safety-critical applications such as industrial control systems, the Time-Sensitive Networking (TSN) Working Group has proposed a series of protocols that introduce new features for TSN-enabled switches and end stations. Notably, the IEEE 802.1Qbv and Qbu standards incorporate the Time-Aware Shaper (TAS) and frame preemption mechanisms, which collectively provide low-latency guarantees for time-sensitive traffic. Deterministic communication constitutes a fundamental requirement for real-time critical systems. However, jitter at end stations remains unavoidable under certain circumstances. This necessitates the establishment of worst-case latency bounds for all network flows. Against this background, this paper presents a formal timing analysis method for TAS networks with preemption under different configurations. The proposed methodology is subsequently refined by accounting for the impacts of multi-hop architectures. Finally, a scheduler is built to determine the delay upper bound and the performance of this approach is validated through comparative evaluations with OMNeT++ simulation results across three distinct scenarios.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信