正在进行的论文:网络演算方法在AFDX网络上的悲观分析

Aakash Soni, Xiaoting Li, Jean-Luc Scharbarg, C. Fraboul
{"title":"正在进行的论文:网络演算方法在AFDX网络上的悲观分析","authors":"Aakash Soni, Xiaoting Li, Jean-Luc Scharbarg, C. Fraboul","doi":"10.1109/SIES.2017.7993380","DOIUrl":null,"url":null,"abstract":"Worst-case delay analysis of real-time networks is mandatory, since distributed real-time applications require bounded end-to-end delays. Switched Ethernet technologies have become popular solutions in the context of real-time systems. Several approaches, based on Network Calculus, trajectories, ..., have been proposed for the worst-case analysis of such technologies. They compute pessimistic upper bounds of end-toend delays. Since this pessimism leads to an over-dimensioning of the network, it is important to quantify the pessimism of the computed upper bounds. In this paper, we propose such a pessimism analysis, based on Network Calculus. In a first step we focus on avionics switched Ethernet network (AFDX) with Fixed Priority/First In First Out (FP/FIFO) scheduling.","PeriodicalId":262681,"journal":{"name":"2017 12th IEEE International Symposium on Industrial Embedded Systems (SIES)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Work in progress paper: pessimism analysis of network calculus approach on AFDX networks\",\"authors\":\"Aakash Soni, Xiaoting Li, Jean-Luc Scharbarg, C. Fraboul\",\"doi\":\"10.1109/SIES.2017.7993380\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Worst-case delay analysis of real-time networks is mandatory, since distributed real-time applications require bounded end-to-end delays. Switched Ethernet technologies have become popular solutions in the context of real-time systems. Several approaches, based on Network Calculus, trajectories, ..., have been proposed for the worst-case analysis of such technologies. They compute pessimistic upper bounds of end-toend delays. Since this pessimism leads to an over-dimensioning of the network, it is important to quantify the pessimism of the computed upper bounds. In this paper, we propose such a pessimism analysis, based on Network Calculus. In a first step we focus on avionics switched Ethernet network (AFDX) with Fixed Priority/First In First Out (FP/FIFO) scheduling.\",\"PeriodicalId\":262681,\"journal\":{\"name\":\"2017 12th IEEE International Symposium on Industrial Embedded Systems (SIES)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 12th IEEE International Symposium on Industrial Embedded Systems (SIES)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIES.2017.7993380\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 12th IEEE International Symposium on Industrial Embedded Systems (SIES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIES.2017.7993380","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

实时网络的最坏情况延迟分析是必需的,因为分布式实时应用程序需要有限的端到端延迟。交换以太网技术已经成为实时系统中流行的解决方案。几种方法,基于网络演算,轨迹,…,对此类技术的最坏情况进行了分析。他们计算了端到端延迟的悲观上界。由于这种悲观情绪会导致网络的过维化,因此对计算出的上界的悲观情绪进行量化是很重要的。在本文中,我们基于网络演算提出了这样一种悲观分析。首先,我们将重点放在具有固定优先级/先进先出(FP/FIFO)调度的航空电子交换以太网(AFDX)上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Work in progress paper: pessimism analysis of network calculus approach on AFDX networks
Worst-case delay analysis of real-time networks is mandatory, since distributed real-time applications require bounded end-to-end delays. Switched Ethernet technologies have become popular solutions in the context of real-time systems. Several approaches, based on Network Calculus, trajectories, ..., have been proposed for the worst-case analysis of such technologies. They compute pessimistic upper bounds of end-toend delays. Since this pessimism leads to an over-dimensioning of the network, it is important to quantify the pessimism of the computed upper bounds. In this paper, we propose such a pessimism analysis, based on Network Calculus. In a first step we focus on avionics switched Ethernet network (AFDX) with Fixed Priority/First In First Out (FP/FIFO) scheduling.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信