Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
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
24
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
Journal
Journal of Systems Architecture
DOI
https://doi.org/10.1016/j.sysarc.2024.103278
Collections
Department of Electrical and Electronics Engineering, Article
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
Z. Ayhan Kilinc, Ş. E. Schmidt, and K. V. Schmidt, “Computation of tight bounds for the worst-case end-to-end delay on Avionics Full-Duplex Switched Ethernet,”
Journal of Systems Architecture
, vol. 156, pp. 0–0, 2024, Accessed: 00, 2024. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85203639230&origin=inward.