Jie Ren;Dong Yang;Weiting Zhang;Kai Gong;Weiliang Chen;Wen Wu;Hongke Zhang
{"title":"PTAS:基于pifo的时间感知整形器,用于时间敏感网络中的海量并发流","authors":"Jie Ren;Dong Yang;Weiting Zhang;Kai Gong;Weiliang Chen;Wen Wu;Hongke Zhang","doi":"10.1109/TNSE.2024.3486038","DOIUrl":null,"url":null,"abstract":"Time-sensitive networking (TSN) specifies a time-aware shaper (TAS) to enhance the real-time support of Ethernet for time-triggered traffic. In TAS, flow/frame isolation is necessary for obtaining a deterministic queuing order, which is the key to achieving determinism. However, this isolation is difficult to fulfill when accessing a large number of concurrent flows generated by industrial devices without TSN capabilities due to the uncontrollable sending times and a limited number of egress queues in TAS. In this paper, a novel TAS framework is designed for massive concurrent flows, named push-in-first-out (PIFO) based time-aware shaper (PTAS). Specifically, the PTAS takes advantage of a PIFO queue to buffer and sort all time-triggered frames based on expected sending time (EST), while an ephemeral memory EST allocation algorithm is proposed to obtain ESTs that can ensure a deterministic queuing order. Through frame sorting rather than conventional isolation, the PTAS efficiently provides a deterministic transmission guarantee for massive concurrent flows. Furthermore, the deterministic flow scheduling constraints for the PTAS are derived, based on which the PTAS is proven to have better schedulability than conventional TAS. In addition to simulation, the PTAS is also implemented on a TSN testbed for evaluation. Extensive experimental results demonstrate that the PTAS can reduce up to 37.0% maximum end-to-end latency, 98.8% jitter, and save 40.1% queue resources in high-concurrency scenarios while scheduling up to 15.5% more flows as compared with conventional TAS.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 1","pages":"83-95"},"PeriodicalIF":6.7000,"publicationDate":"2024-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"PTAS: PIFO-Based Time-Aware Shaper for Massive Concurrent Flows in Time-Sensitive Networks\",\"authors\":\"Jie Ren;Dong Yang;Weiting Zhang;Kai Gong;Weiliang Chen;Wen Wu;Hongke Zhang\",\"doi\":\"10.1109/TNSE.2024.3486038\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Time-sensitive networking (TSN) specifies a time-aware shaper (TAS) to enhance the real-time support of Ethernet for time-triggered traffic. In TAS, flow/frame isolation is necessary for obtaining a deterministic queuing order, which is the key to achieving determinism. However, this isolation is difficult to fulfill when accessing a large number of concurrent flows generated by industrial devices without TSN capabilities due to the uncontrollable sending times and a limited number of egress queues in TAS. In this paper, a novel TAS framework is designed for massive concurrent flows, named push-in-first-out (PIFO) based time-aware shaper (PTAS). Specifically, the PTAS takes advantage of a PIFO queue to buffer and sort all time-triggered frames based on expected sending time (EST), while an ephemeral memory EST allocation algorithm is proposed to obtain ESTs that can ensure a deterministic queuing order. Through frame sorting rather than conventional isolation, the PTAS efficiently provides a deterministic transmission guarantee for massive concurrent flows. Furthermore, the deterministic flow scheduling constraints for the PTAS are derived, based on which the PTAS is proven to have better schedulability than conventional TAS. In addition to simulation, the PTAS is also implemented on a TSN testbed for evaluation. Extensive experimental results demonstrate that the PTAS can reduce up to 37.0% maximum end-to-end latency, 98.8% jitter, and save 40.1% queue resources in high-concurrency scenarios while scheduling up to 15.5% more flows as compared with conventional TAS.\",\"PeriodicalId\":54229,\"journal\":{\"name\":\"IEEE Transactions on Network Science and Engineering\",\"volume\":\"12 1\",\"pages\":\"83-95\"},\"PeriodicalIF\":6.7000,\"publicationDate\":\"2024-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Network Science and Engineering\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10734149/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10734149/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
PTAS: PIFO-Based Time-Aware Shaper for Massive Concurrent Flows in Time-Sensitive Networks
Time-sensitive networking (TSN) specifies a time-aware shaper (TAS) to enhance the real-time support of Ethernet for time-triggered traffic. In TAS, flow/frame isolation is necessary for obtaining a deterministic queuing order, which is the key to achieving determinism. However, this isolation is difficult to fulfill when accessing a large number of concurrent flows generated by industrial devices without TSN capabilities due to the uncontrollable sending times and a limited number of egress queues in TAS. In this paper, a novel TAS framework is designed for massive concurrent flows, named push-in-first-out (PIFO) based time-aware shaper (PTAS). Specifically, the PTAS takes advantage of a PIFO queue to buffer and sort all time-triggered frames based on expected sending time (EST), while an ephemeral memory EST allocation algorithm is proposed to obtain ESTs that can ensure a deterministic queuing order. Through frame sorting rather than conventional isolation, the PTAS efficiently provides a deterministic transmission guarantee for massive concurrent flows. Furthermore, the deterministic flow scheduling constraints for the PTAS are derived, based on which the PTAS is proven to have better schedulability than conventional TAS. In addition to simulation, the PTAS is also implemented on a TSN testbed for evaluation. Extensive experimental results demonstrate that the PTAS can reduce up to 37.0% maximum end-to-end latency, 98.8% jitter, and save 40.1% queue resources in high-concurrency scenarios while scheduling up to 15.5% more flows as compared with conventional TAS.
期刊介绍:
The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.