Worst-case backlpg for AFDX network with n-priorities

Abstract : In most recent avionics systems, AFDX (Avionics Full Duplex Switched Ethernet) is the network used to replace the previously employed point-to-point networks. AFDX guarantees bandwidth reservations by means of virtual links which can be classified with two priority levels. AFDX compliant switches implement output buffers at each switch output port. The stored frames leave each output port according to a fixed priority FIFO policy. Overflow of these buffers must be avoided at all cost to prevent data loss. Although the AFDX standard determines the minimum buffer size dedicated to an output port, the actual length of each priority buffer, is a designer decision. Previous works address the worst case backlog of ADFX buffers of one and two priorities. In this work we assume an extended AFDX network in which virtual links can be classified into n-priorities and present the problem statement to compute an upper bound on the worst case backlog faced by each buffer of each output port in each switch of the network.
Keywords : AFDX
Complete list of metadatas

Cited literature [5 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01140355
Contributor : Open Archive Toulouse Archive Ouverte (oatao) <>
Submitted on : Wednesday, April 8, 2015 - 2:06:56 PM
Last modification on : Thursday, October 17, 2019 - 8:53:14 AM
Long-term archiving on : Thursday, July 9, 2015 - 10:46:51 AM

File

Coelho_13181.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01140355, version 1
  • OATAO : 13181

Citation

Rodrigo Coelho, Gerhard Fohler, Jean-Luc Scharbarg. Worst-case backlpg for AFDX network with n-priorities. International Workshop on Real-Time Networks - RTN 2014, Jul 2014, Madrid, Spain. pp. 11-14. ⟨hal-01140355⟩

Share

Metrics

Record views

120

Files downloads

113