{"title":"A Model to Calculate Exact End-to-End Delay of Sporadic Flows on AFDX Network Using Mathematical Programming","authors":"Leonardo Malta, R. S. Oliveira","doi":"10.1109/SBESC.2012.25","DOIUrl":null,"url":null,"abstract":"Avionics Full DupleX (AFDX) Switched Ethernet technology provides a deterministic network to avionics context. Guarantees on worst-case end-to-end (ETE) communication delays are required for certification purposes. This paper identifies the worst-case ETE analysis as an optimization problem and proposes a mathematical programming approach to calculate an exact worst-case delay and the corresponding scenario. It allows to significantly increase the size of the configuration for which an exact worst-case can be determined. The approach considers a set of sporadic flows with no assumption concerning the arrival time of packets.","PeriodicalId":112286,"journal":{"name":"2012 Brazilian Symposium on Computing System Engineering","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 Brazilian Symposium on Computing System Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SBESC.2012.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Avionics Full DupleX (AFDX) Switched Ethernet technology provides a deterministic network to avionics context. Guarantees on worst-case end-to-end (ETE) communication delays are required for certification purposes. This paper identifies the worst-case ETE analysis as an optimization problem and proposes a mathematical programming approach to calculate an exact worst-case delay and the corresponding scenario. It allows to significantly increase the size of the configuration for which an exact worst-case can be determined. The approach considers a set of sporadic flows with no assumption concerning the arrival time of packets.