Deficit Round-Robin: Network Calculus based Worst-Case Traversal Time Analysis Revisited

Aakash Soni, Jean-Luc Scharbarg
{"title":"Deficit Round-Robin: Network Calculus based Worst-Case Traversal Time Analysis Revisited","authors":"Aakash Soni, Jean-Luc Scharbarg","doi":"10.1109/LCN53696.2022.9843526","DOIUrl":null,"url":null,"abstract":"Deficit Round-Robin (DRR) is a promising service discipline for real-time Ethernet without a global synchronisation. Two improved Network Calculus approaches have been proposed to provide the required bounds on end-to-end delays. The first one is fast but can be optimistic for cornet cases. The second one is safe but highly time consuming. In this paper, we remove the potential optimism of the first approach while keeping its low complexity.","PeriodicalId":303965,"journal":{"name":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 47th Conference on Local Computer Networks (LCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN53696.2022.9843526","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Deficit Round-Robin (DRR) is a promising service discipline for real-time Ethernet without a global synchronisation. Two improved Network Calculus approaches have been proposed to provide the required bounds on end-to-end delays. The first one is fast but can be optimistic for cornet cases. The second one is safe but highly time consuming. In this paper, we remove the potential optimism of the first approach while keeping its low complexity.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
赤字轮循:基于网络演算的最坏情况遍历时间分析
赤字轮询(DRR)是一种很有前途的无全局同步的实时以太网服务规程。提出了两种改进的网络演算方法来提供端到端延迟所需的边界。第一种方法比较快,但对短号的情况可能比较乐观。第二种方法是安全的,但非常耗时。在本文中,我们消除了第一种方法的潜在乐观性,同时保持了其低复杂度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
MicroTL: Transfer Learning on Low-Power IoT Devices Service-Based Identification of Highly Coupled Mobile Applications Raising the AWAREness of BFT Protocols for Soaring Network Delays How to build socio-organizational information from remote IP addresses to enrich security analysis? ReCEIF: Reinforcement Learning-Controlled Effective Ingress Filtering
×
引用
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