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

Ayhan Kilinc Z., SCHMİDT Ş. E., SCHMİDT K. V.

Journal of Systems Architecture, cilt.156, 2024 (SCI-Expanded) identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 156
  • Basım Tarihi: 2024
  • Doi Numarası: 10.1016/j.sysarc.2024.103278
  • Dergi Adı: Journal of Systems Architecture
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, ABI/INFORM, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Compendex, Computer & Applied Sciences, INSPEC, DIALNET
  • Anahtar Kelimeler: AFDX, Avionics, Real-time networks, Switched Ethernet, Worst-case delay
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

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.