Upper bound computation for buffer backlog on AFDX networks with multiple priority virtual links - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

Upper bound computation for buffer backlog on AFDX networks with multiple priority virtual links

Abstract

In recent avionics systems, AFDX (Avionics Full Duplex Switched Ethernet) is the network used to replace the previously deployed point-to-point networks. In AFDX networks, nodes are not synchronized and therefore data contention repeatedly occurs at the switches output ports. AFDX switches implement output buffers on each output port to address the data contention issue. Considering the safety critical application of AFDX networks, overflow of these buffers must be avoided at all cost to prevent data loss. In this paper we consider AFDX networks that allow for the classification of traffic into more than two priority levels. We present a novel method to compute an upper bound for the backlog of each priority buffer of each output port on a AFDX network with multiple priority traffic.
Fichier principal
Vignette du fichier
coelho_22332.pdf (383.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02348192 , version 1 (05-11-2019)

Identifiers

  • HAL Id : hal-02348192 , version 1
  • OATAO : 22332

Cite

Rodrigo Coelho, Gerhard Fohler, Jean-Luc Scharbarg. Upper bound computation for buffer backlog on AFDX networks with multiple priority virtual links. Annual ACM Symposium on Applied Computing (SAC 2017), Apr 2017, Marrakech, Morocco. pp.586-593. ⟨hal-02348192⟩
34 View
81 Download

Share

Gmail Facebook X LinkedIn More