Feng Luo , Lei Zhu , Zitong Wang , Haotian Gan , Yunpeng Li , Zhenyu Yang , Dengcheng Liu
{"title":"时间敏感网络中支持抢占的时间感知整形器的可调度性分析","authors":"Feng Luo , Lei Zhu , Zitong Wang , Haotian Gan , Yunpeng Li , Zhenyu Yang , 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 , Lei Zhu , Zitong Wang , Haotian Gan , Yunpeng Li , Zhenyu Yang , 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}
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 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.