{"title":"Flow Preprocessing for Online Routing and Scheduling in Time-Sensitive Networks","authors":"Zehua Chen, Zhili Wang, Xingyu Chen","doi":"10.1109/BMSB58369.2023.10211213","DOIUrl":null,"url":null,"abstract":"More and more attention has been attracted to online flow scheduling mechanisms in Time-Sensitive Networks (TSN) because of the significantly increasing demand for low delay and low jitter communication in fields such as smart factories or automatic vehicles. However, because of the lack of flow information known in advance, such as when and what kind of flows will arrive and will be scheduled, it’s easy for most online routing and scheduling methods to reach the bottleneck of flow scheduling in the scenario where there are time-triggered flows with large period differences to be scheduled, resulting in a low scheduling success rate.In this paper, a flow preprocessing method is proposed to filter flows with certain characteristics that have potential negative influence on the overall scheduling success rate or bandwidth utilization according to their periods and arrival probability. The proposed method can be easily superimposed on any kind of online routing and scheduling methods in TSN to improve performance. The flow preprocessing method is evaluated in scenarios with different numbers and types of flows, and the result shows that the flow scheduling with our preprocessing method outperform the flow scheduling without preprocessing in terms of scheduling success rate, bandwidth utilization and computation time.","PeriodicalId":13080,"journal":{"name":"IEEE international Symposium on Broadband Multimedia Systems and Broadcasting","volume":"10 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2023-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE international Symposium on Broadband Multimedia Systems and Broadcasting","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/BMSB58369.2023.10211213","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
More and more attention has been attracted to online flow scheduling mechanisms in Time-Sensitive Networks (TSN) because of the significantly increasing demand for low delay and low jitter communication in fields such as smart factories or automatic vehicles. However, because of the lack of flow information known in advance, such as when and what kind of flows will arrive and will be scheduled, it’s easy for most online routing and scheduling methods to reach the bottleneck of flow scheduling in the scenario where there are time-triggered flows with large period differences to be scheduled, resulting in a low scheduling success rate.In this paper, a flow preprocessing method is proposed to filter flows with certain characteristics that have potential negative influence on the overall scheduling success rate or bandwidth utilization according to their periods and arrival probability. The proposed method can be easily superimposed on any kind of online routing and scheduling methods in TSN to improve performance. The flow preprocessing method is evaluated in scenarios with different numbers and types of flows, and the result shows that the flow scheduling with our preprocessing method outperform the flow scheduling without preprocessing in terms of scheduling success rate, bandwidth utilization and computation time.