Georges Kemayo, Nassima Benammar, F. Ridouard, Henri Bauer, P. Richard
{"title":"Improving AFDX end-to-end delays analysis","authors":"Georges Kemayo, Nassima Benammar, F. Ridouard, Henri Bauer, P. Richard","doi":"10.1109/ETFA.2015.7301463","DOIUrl":null,"url":null,"abstract":"The AFDX (Avionics Full DupleX Switched Ethernet) is the backbone network of most modern civilian aircraft. For certification reasons, a guaranteed upper bound has to be determined on the end-to-end delay for all transmitted flows. Several approaches have been designed in order to analyze such delays. In this paper, we focus on the Forward End-to-End delays Analysis (FA). This method is based on real-time scheduling results. Our goal is to propose an improvement, that reduces the pessimism of the computed bounds, compared to earlier versions of the method. The improvement relies on the way the serialization of packets sharing a common link is taken into account. We also propose a comparative analysis on a simple configuration with two other methods (Network Calculus and the Trajectory approach).","PeriodicalId":6862,"journal":{"name":"2015 IEEE 20th Conference on Emerging Technologies & Factory Automation (ETFA)","volume":"9 1","pages":"1-8"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"29","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 20th Conference on Emerging Technologies & Factory Automation (ETFA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ETFA.2015.7301463","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 29
Abstract
The AFDX (Avionics Full DupleX Switched Ethernet) is the backbone network of most modern civilian aircraft. For certification reasons, a guaranteed upper bound has to be determined on the end-to-end delay for all transmitted flows. Several approaches have been designed in order to analyze such delays. In this paper, we focus on the Forward End-to-End delays Analysis (FA). This method is based on real-time scheduling results. Our goal is to propose an improvement, that reduces the pessimism of the computed bounds, compared to earlier versions of the method. The improvement relies on the way the serialization of packets sharing a common link is taken into account. We also propose a comparative analysis on a simple configuration with two other methods (Network Calculus and the Trajectory approach).