DocumentCode
2568075
Title
A tight end-to-end delay bound and scheduling optimization of an avionics AFDX network
Author
Tawk, Melhem ; Zhu, Guchuan ; Savaria, Yvon ; Liu, Xue ; Li, Jian ; Hu, Fei
Author_Institution
Ecole Polytech. de Montreal, Montreal, QC, Canada
fYear
2011
fDate
16-20 Oct. 2011
Abstract
Inspired by the response time analysis (RTA) technique, this paper presents a new method for the estimation of end-to-end delay bounds in AFDX networks. For the purpose of comparison, an end-to-end delay analysis based on the Network Calculus (NC) is first carried out. In order to apply the RTA technique, an interference model of virtual links with common transmission paths in a typical AFDX network configuration has been established. The corresponding worst-case response time (WCRT) as well as a schedulability criteria are then derived. Furthermore, a procedure for scheduling policy optimization is deduced based on RTA. Numerical analysis shows that the RTA can achieve a tighter end-to-end delay bound compared to the one given by NC. Simulations are also carried out to confirm the validity of the proposed approach.
Keywords
avionics; optimisation; scheduling; RTA technique; avionics AFDX network configuration; end-to-end delay analysis; interference model; network calculus; response time analysis technique; scheduling policy optimization; tight end-to-end delay bound optimization; virtual link; worst-case response time; Calculus; Delay; Interference; Multiplexing; Optimal scheduling; Processor scheduling; Time factors; AFDX; Delay bound; Network calculus; Real-time scheduling; Response-time analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
Digital Avionics Systems Conference (DASC), 2011 IEEE/AIAA 30th
Conference_Location
Seattle, WA
ISSN
2155-7195
Print_ISBN
978-1-61284-797-9
Type
conf
DOI
10.1109/DASC.2011.6096118
Filename
6096118
Link To Document