TSN中一种结合入口整形的流量调度算法

Wenxuan Han, Yanjue Li, Changchuan Yin
{"title":"TSN中一种结合入口整形的流量调度算法","authors":"Wenxuan Han, Yanjue Li, Changchuan Yin","doi":"10.1109/WCSP55476.2022.10039213","DOIUrl":null,"url":null,"abstract":"Most of the recent researches related to hybrid traffic scheduling in Time-Sensitive Networking (TSN) focus on how to ensure bounded low-delay transmission for Scheduled Traffic (ST) and Stream Reservation (SR) traffic. However, if high-priority traffic blocks Best Effort (BE) traffic represented by data logging and periodic software updates for a long time, the end-to-end delay of BE messages will be too large. To reduce the blocking of SR traffic on BE traffic by reducing the reserved bandwidth for SR traffic, this paper proposes a traffic scheduling algorithm combined with ingress shaping. First, add ingress buffers before SR queues. Then, schedule SR traffic on a per-flow basis in the TSN switch by limiting the rate at which frames in each ingress buffer enter the SR queue. Finally, joint egress shaping and ingress shaping to reserve bandwidth resources that match its delay requirement for each SR flow. Simulation results show that the maximum end-to-end delay of BE messages can be reduced by 0.32%~17.19%.","PeriodicalId":199421,"journal":{"name":"2022 14th International Conference on Wireless Communications and Signal Processing (WCSP)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Traffic Scheduling Algorithm Combined with Ingress Shaping in TSN\",\"authors\":\"Wenxuan Han, Yanjue Li, Changchuan Yin\",\"doi\":\"10.1109/WCSP55476.2022.10039213\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Most of the recent researches related to hybrid traffic scheduling in Time-Sensitive Networking (TSN) focus on how to ensure bounded low-delay transmission for Scheduled Traffic (ST) and Stream Reservation (SR) traffic. However, if high-priority traffic blocks Best Effort (BE) traffic represented by data logging and periodic software updates for a long time, the end-to-end delay of BE messages will be too large. To reduce the blocking of SR traffic on BE traffic by reducing the reserved bandwidth for SR traffic, this paper proposes a traffic scheduling algorithm combined with ingress shaping. First, add ingress buffers before SR queues. Then, schedule SR traffic on a per-flow basis in the TSN switch by limiting the rate at which frames in each ingress buffer enter the SR queue. Finally, joint egress shaping and ingress shaping to reserve bandwidth resources that match its delay requirement for each SR flow. Simulation results show that the maximum end-to-end delay of BE messages can be reduced by 0.32%~17.19%.\",\"PeriodicalId\":199421,\"journal\":{\"name\":\"2022 14th International Conference on Wireless Communications and Signal Processing (WCSP)\",\"volume\":\"67 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 14th International Conference on Wireless Communications and Signal Processing (WCSP)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCSP55476.2022.10039213\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 14th International Conference on Wireless Communications and Signal Processing (WCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP55476.2022.10039213","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

最近关于时间敏感网络(TSN)中混合流量调度的研究大多集中在如何保证计划流量(ST)和流保留(SR)的有界低延迟传输。但是,如果高优先级流量长时间阻塞以数据记录和定期软件更新为代表的Best Effort (BE)流量,则BE消息的端到端延迟将过大。为了减少SR流量对BE流量的阻塞,通过减少SR流量的预留带宽,提出了一种结合入口整形的流量调度算法。首先,在SR队列之前添加入口缓冲区。然后,通过限制每个入接口缓冲区中的帧进入SR队列的速率,在TSN交换机中按每流调度SR流量。最后,联合出口整形和入口整形,为每个SR流保留与其时延要求相匹配的带宽资源。仿真结果表明,该方法可使BE消息的最大端到端延迟降低0.32%~17.19%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Traffic Scheduling Algorithm Combined with Ingress Shaping in TSN
Most of the recent researches related to hybrid traffic scheduling in Time-Sensitive Networking (TSN) focus on how to ensure bounded low-delay transmission for Scheduled Traffic (ST) and Stream Reservation (SR) traffic. However, if high-priority traffic blocks Best Effort (BE) traffic represented by data logging and periodic software updates for a long time, the end-to-end delay of BE messages will be too large. To reduce the blocking of SR traffic on BE traffic by reducing the reserved bandwidth for SR traffic, this paper proposes a traffic scheduling algorithm combined with ingress shaping. First, add ingress buffers before SR queues. Then, schedule SR traffic on a per-flow basis in the TSN switch by limiting the rate at which frames in each ingress buffer enter the SR queue. Finally, joint egress shaping and ingress shaping to reserve bandwidth resources that match its delay requirement for each SR flow. Simulation results show that the maximum end-to-end delay of BE messages can be reduced by 0.32%~17.19%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信