A Sensitivity Analysis of Two Worst-Case Delay Computation Methods for SpaceWire Networks

Thomas Ferrandiz, F. Frances, C. Fraboul
{"title":"A Sensitivity Analysis of Two Worst-Case Delay Computation Methods for SpaceWire Networks","authors":"Thomas Ferrandiz, F. Frances, C. Fraboul","doi":"10.1109/ECRTS.2012.35","DOIUrl":null,"url":null,"abstract":"Space Wire is a standard of on-board networks for satellites promoted by the ESA. As the ESA plans to use Space Wire as the sole network for both critical and non-critical traffics, network designers need tools to check that all the critical messages meet their deadlines. We previously proposed two such tools to compute an upper-bound on the worst-case end-to-end delay of a packet traversing a Space Wire network. The main contribution of this paper is the comparison of those two methods on a network configuration provided by Thales Alenia Space that is representative of next generation large satellites. The goal is to identify the key parameters that affect the bounds computed by the methods. We then conduct a sensitivity analysis on simpler network configurations to study the impact of those parameters on the methods and determine which method works better in different situations.","PeriodicalId":425794,"journal":{"name":"2012 24th Euromicro Conference on Real-Time Systems","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 24th Euromicro Conference on Real-Time Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ECRTS.2012.35","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

Abstract

Space Wire is a standard of on-board networks for satellites promoted by the ESA. As the ESA plans to use Space Wire as the sole network for both critical and non-critical traffics, network designers need tools to check that all the critical messages meet their deadlines. We previously proposed two such tools to compute an upper-bound on the worst-case end-to-end delay of a packet traversing a Space Wire network. The main contribution of this paper is the comparison of those two methods on a network configuration provided by Thales Alenia Space that is representative of next generation large satellites. The goal is to identify the key parameters that affect the bounds computed by the methods. We then conduct a sensitivity analysis on simpler network configurations to study the impact of those parameters on the methods and determine which method works better in different situations.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
空间线网络两种最坏情况时延计算方法的灵敏度分析
太空线是欧洲航天局推广的卫星机载网络标准。由于欧空局计划使用空间线作为关键和非关键流量的唯一网络,网络设计者需要工具来检查所有关键消息是否符合他们的截止日期。我们之前提出了两个这样的工具来计算穿越空间线网络的数据包的最坏情况端到端延迟的上限。本文的主要贡献是在泰利斯阿莱尼亚空间公司提供的网络配置上对这两种方法进行比较,该网络配置是下一代大型卫星的代表。目标是确定影响方法计算的边界的关键参数。然后,我们对更简单的网络配置进行敏感性分析,研究这些参数对方法的影响,并确定哪种方法在不同情况下效果更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Deriving Monitoring Bounds for Distributed Real-Time Systems Schedulability Analysis of Periodic Tasks Implementing Synchronous Finite State Machines A Sensitivity Analysis of Two Worst-Case Delay Computation Methods for SpaceWire Networks Measurement-Based Probabilistic Timing Analysis for Multi-path Programs Supporting Nested Locking in Multiprocessor Real-Time Systems
×
引用
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