时间敏感网络中帧排序的一种成形机制

Zerui Tian, Fan Yang
{"title":"时间敏感网络中帧排序的一种成形机制","authors":"Zerui Tian, Fan Yang","doi":"10.1109/ICCC56324.2022.10065942","DOIUrl":null,"url":null,"abstract":"Time Sensitive Networking (TSN) is a recently proposed technology claiming to be capable of transmitting both best effort and real-time traffic simultaneously. TSN achieves real-time communications by per-queue Time-Division Multiplexing and takes no notice of the details of incoming frames. Therefore, the forwarding in TSN suffers from packet reordering because the practical forward sequences may differ from the window schedules, i.e., frame disordering errors. To enhance the robustness of TSN, in this paper, we propose a shaping mechanism, FOS, for frame ordering. FOS is able to sort incoming frames into expected sequences, therefore, providing the capacity of frame ordering configuration. To evaluate its performance, we conduct simulations for FOS based on a complete switch model under various conditions. The results prove the functional correctness of FOS and demonstrate that the FOS residence time is 15% to 34% of the total residence time. Therefore, FOS is able to guarantee the frame sequences without requiring unreasonable extra time.","PeriodicalId":263098,"journal":{"name":"2022 IEEE 8th International Conference on Computer and Communications (ICCC)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"FOS: A Shaping Mechanism for Frame Ordering in Time Sensitive Networking\",\"authors\":\"Zerui Tian, Fan Yang\",\"doi\":\"10.1109/ICCC56324.2022.10065942\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Time Sensitive Networking (TSN) is a recently proposed technology claiming to be capable of transmitting both best effort and real-time traffic simultaneously. TSN achieves real-time communications by per-queue Time-Division Multiplexing and takes no notice of the details of incoming frames. Therefore, the forwarding in TSN suffers from packet reordering because the practical forward sequences may differ from the window schedules, i.e., frame disordering errors. To enhance the robustness of TSN, in this paper, we propose a shaping mechanism, FOS, for frame ordering. FOS is able to sort incoming frames into expected sequences, therefore, providing the capacity of frame ordering configuration. To evaluate its performance, we conduct simulations for FOS based on a complete switch model under various conditions. The results prove the functional correctness of FOS and demonstrate that the FOS residence time is 15% to 34% of the total residence time. Therefore, FOS is able to guarantee the frame sequences without requiring unreasonable extra time.\",\"PeriodicalId\":263098,\"journal\":{\"name\":\"2022 IEEE 8th International Conference on Computer and Communications (ICCC)\",\"volume\":\"44 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 IEEE 8th International Conference on Computer and Communications (ICCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCC56324.2022.10065942\",\"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 IEEE 8th International Conference on Computer and Communications (ICCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCC56324.2022.10065942","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

时间敏感网络(TSN)是最近提出的一项技术,声称能够同时传输最佳努力和实时流量。TSN通过每队列时分复用实现实时通信,不需要注意传入帧的细节。因此,TSN中的转发存在数据包重排序问题,因为实际转发序列可能与窗口调度不同,即帧无序错误。为了增强TSN的鲁棒性,本文提出了一种用于帧排序的成形机制FOS。因此,FOS能够将传入的帧排序到期望的序列中,从而提供帧排序配置的能力。为了评估其性能,我们基于一个完整的开关模型对不同条件下的FOS进行了仿真。结果证明了FOS的功能正确性,FOS的停留时间占总停留时间的15% ~ 34%。因此,FOS能够保证帧序列,而不需要不合理的额外时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
FOS: A Shaping Mechanism for Frame Ordering in Time Sensitive Networking
Time Sensitive Networking (TSN) is a recently proposed technology claiming to be capable of transmitting both best effort and real-time traffic simultaneously. TSN achieves real-time communications by per-queue Time-Division Multiplexing and takes no notice of the details of incoming frames. Therefore, the forwarding in TSN suffers from packet reordering because the practical forward sequences may differ from the window schedules, i.e., frame disordering errors. To enhance the robustness of TSN, in this paper, we propose a shaping mechanism, FOS, for frame ordering. FOS is able to sort incoming frames into expected sequences, therefore, providing the capacity of frame ordering configuration. To evaluate its performance, we conduct simulations for FOS based on a complete switch model under various conditions. The results prove the functional correctness of FOS and demonstrate that the FOS residence time is 15% to 34% of the total residence time. Therefore, FOS is able to guarantee the frame sequences without requiring unreasonable extra time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Backward Edge Pointer Protection Technology Based on Dynamic Instrumentation Experimental Design of Router Debugging based Neighbor Cache States Change of IPv6 Nodes Sharing Big Data Storage for Air Traffic Management Study of Non-Orthogonal Multiple Access Technology for Satellite Communications A Joint Design of Polar Codes and Physical-layer Network Coding in Visible Light Communication System
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1