A Configuration Framework for Multi-level Preemption Schemes in Time Sensitive Networking

M. Ojewale, P. Yomsi, L. Almeida
{"title":"A Configuration Framework for Multi-level Preemption Schemes in Time Sensitive Networking","authors":"M. Ojewale, P. Yomsi, L. Almeida","doi":"10.1145/3534879.3534891","DOIUrl":null,"url":null,"abstract":"To reduce the latency of time-sensitive flows in Ethernet networks, the IEEE TSN Task Group introduced the IEEE 802.1Qbu Standard, which specifies a 1-level preemption scheme for IEEE 802.1 networks. Recently, serious limitations of this scheme w.r.t. flows responsiveness were exposed and the so-called multi-level preemption approach was proposed to address these drawbacks. As is the case with most, if not all, real-time and/or time-sensitive preemptive systems, an appropriate priority-to-flow assignment policy plays a central role in the resulting performance of both 1-level and multi-level preemption schemes to avoid the over-provisioning and/or the sub-optimal use of hardware resources. Yet on another front, the multi-level preemption scheme raises new configuration challenges. Specifically, the right number of preemption level(s) to enable for swift transmission of flows; and the flow-to-preemption-class assignment synthesis remain open problems. To the best of our knowledge, there is no prior work in the literature addressing these important challenges. In this work, we address these three challenges. We demonstrate the applicability of our proposed solution by using both synthetic and real life use-cases. Our experimental results show that multi-level preemption schemes improve schedulability of flows by over 12% as compared to a 1-level preemption scheme, and at a higher abstraction level, the proposed configuration framework improves the schedulability of flows by up to 6% as compared to the dominant Deadline Monotonic Priority Ordering.","PeriodicalId":192435,"journal":{"name":"Proceedings of the 30th International Conference on Real-Time Networks and Systems","volume":"293 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 30th International Conference on Real-Time Networks and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3534879.3534891","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

To reduce the latency of time-sensitive flows in Ethernet networks, the IEEE TSN Task Group introduced the IEEE 802.1Qbu Standard, which specifies a 1-level preemption scheme for IEEE 802.1 networks. Recently, serious limitations of this scheme w.r.t. flows responsiveness were exposed and the so-called multi-level preemption approach was proposed to address these drawbacks. As is the case with most, if not all, real-time and/or time-sensitive preemptive systems, an appropriate priority-to-flow assignment policy plays a central role in the resulting performance of both 1-level and multi-level preemption schemes to avoid the over-provisioning and/or the sub-optimal use of hardware resources. Yet on another front, the multi-level preemption scheme raises new configuration challenges. Specifically, the right number of preemption level(s) to enable for swift transmission of flows; and the flow-to-preemption-class assignment synthesis remain open problems. To the best of our knowledge, there is no prior work in the literature addressing these important challenges. In this work, we address these three challenges. We demonstrate the applicability of our proposed solution by using both synthetic and real life use-cases. Our experimental results show that multi-level preemption schemes improve schedulability of flows by over 12% as compared to a 1-level preemption scheme, and at a higher abstraction level, the proposed configuration framework improves the schedulability of flows by up to 6% as compared to the dominant Deadline Monotonic Priority Ordering.
时间敏感网络中多级抢占方案的配置框架
为了减少以太网中时间敏感流的延迟,IEEE TSN任务组引入了IEEE 802.1 qbu标准,该标准为IEEE 802.1网络指定了1级抢占方案。近年来,该方案的严重局限性暴露出来,并提出了所谓的多层次抢占方法来解决这些缺陷。与大多数(如果不是全部的话)实时和/或时间敏感的抢占系统一样,适当的优先级到流分配策略在一级和多级抢占方案的最终性能中起着核心作用,以避免过度配置和/或硬件资源的次优使用。然而,在另一方面,多级抢占方案提出了新的配置挑战。具体来说,是正确数量的抢占级别,以实现流量的快速传输;而流到抢占类的分配综合仍然是有待解决的问题。据我们所知,文献中没有针对这些重要挑战的先前工作。在这项工作中,我们将应对这三个挑战。我们通过使用合成用例和实际用例来演示我们提出的解决方案的适用性。实验结果表明,与一级抢占方案相比,多级抢占方案可将流的可调度性提高12%以上,在更高的抽象级别上,与占主导地位的截止日期单调优先级排序相比,所提出的配置框架可将流的可调度性提高6%以上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信
小红书