Computation of tight bounds for the worst-case end-to-end delay on Avionics Full-Duplex Switched Ethernet

Date

2024-11-01

Author

Ayhan Kilinc, Zeynep
Schmidt, Şenan Ece
Schmidt, Klaus Verner

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

39
views

0
downloads

Cite This

Avionics Full-Duplex Switched Ethernet (AFDX) is a fault-tolerant real-time communication bus for safety–critical applications in aircraft. AFDX configures communication channels, denoted as virtual links (VLs), ensuring bounded message delays through traffic shaping at both end-systems and switches. Effective AFDX network design necessitates computing the worst-case end-to-end delay of time-critical VLs to meet specified message deadlines. This paper presents a new method for calculating tight bounds on the worst-case end-to-end delay for each VL in an AFDX network. We introduce the new notion of an extended uninterrupted transmission interval, which is the prerequisite for computing the worst-case queuing delay at switches. Adding up these queuing delays along the path of each VL between end-systems yields a tight upper bound on the worst-case end-to-end delay. The correctness of our results is formally proved, and comprehensive simulation experiments on different example networks confirm the tightness of our bound. These simulations also demonstrate the superior performance of our method compared to existing approaches that offer more pessimistic as well as optimistic results.

Subject Keywords

AFDX, Avionics, Real-time networks, Switched Ethernet, Worst-case delay

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85203639230&origin=inward
https://hdl.handle.net/11511/111239

Collections

Department of Electrical and Electronics Engineering, Article