Forward End-to-End Delay for AFDX Networks

Benammar, Nassima; Ridouard, Frédéric; Bauer, Henri; Richard, Pascal

doi:10.1109/tii.2017.2720799

Cited by 23 publications

(27 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…By considering the serialisation effect, the Forward Approach can compute a tighter upper bound of the end-to-end transmission delays. Recently, our research finds that the serialisation effect might induce an optimistic (underestimated) computation (16) . In this paper, we provide a new computation of the serialisation effect, and the comparative experiments demonstrate this new computation can reduce the optimism (underestimation) and obtain a more accurate upper bound of the end-to-end transmission delays.…”

Section: Introductionmentioning

confidence: 91%

“…The Forward Approach is a pessimistic (overestimated) computation (13) , and can also be optimised by taking into account the serialisation effect (12) . Whereas, recent research finds the serialisation effect might induce optimism (underestimation) during the computation (16) . The objective of this paper is to consider a new computation of the serialisation effect in order that the Forward Approach can obtain an upper bound of the end-to-end transmission delays more accurately.…”

Section: Related Workmentioning

confidence: 97%

“…The Forward Approach (FA) evaluates the maximum backlog Bklg h i at each node h along path m i using Smin h i and Smax h i , and the worst-case end-to-end transmission delay R i can be computed (16) .…”

Section: The Aeronautical Journalmentioning

confidence: 99%

“…Lemma 1. (16) The maximum backlog generated by flow v j at node h is achieved when packet m j arrives at node h at time θ . Suppose θ is h j earlier than b, we have:…”

Section: Request Bound Functionmentioning

confidence: 99%

“…Theorem 4 (16) The Request Bound Function RBF h j (t) for flow v j passing through node h in a time interval of length t (t > 0) is:…”

Section: Request Bound Functionmentioning

confidence: 99%

See 4 more Smart Citations

Analysis of forward approach for upper bounding end-to-end transmission delays over distributed real-time avionics networks

Yang

2020

Aeronaut. j.

View full text Add to dashboard Cite

Distributed real-time avionics networks have been subjected to a great evolution in terms of functionality and complexity. A direct consequence of this evolution is a continual growth of data exchange. AFDX standardised as ARINC 664 is chosen as the backbone network for those distributed real-time avionics networks as it offers high throughput and does not require global clock synchronisation. For certification reasons and engineering research, a deterministic upper bound of the end-to-end transmission delay for packets of each flow should be guaranteed. The Forward Approach (FA) is proposed for the computation of the worst-case end-to-end transmission delay. This approach iteratively estimates the maximum backlog (amount of the pending packets) in each visited switch along the transmission path, and the worst-case end-to-end transmission delay can be computed. Although it is pessimistic (overestimated), the Forward Approach can provide a tighter upper bound of the end-to-end transmission delay while considering the serialisation effect. Recently, our research finds the computation of the serialisation effect might induce an optimistic (underestimated) upper bound. In this paper, we analyse the pessimism in the Forward Approach and the optimism induced by the computation of the serialisation effect, and then we provide a new computation of the serialisation effect. We compare this new computation with the original one, the experiments show that the new computation reduces the optimism and the upper bound of the end-to-end transmission delay can be computed more accurately.

show abstract

Section: Introductionmentioning

confidence: 91%

Section: Related Workmentioning

confidence: 97%

Section: The Aeronautical Journalmentioning

confidence: 99%

“…Lemma 1. (16) The maximum backlog generated by flow v j at node h is achieved when packet m j arrives at node h at time θ . Suppose θ is h j earlier than b, we have:…”

Section: Request Bound Functionmentioning

confidence: 99%

“…Theorem 4 (16) The Request Bound Function RBF h j (t) for flow v j passing through node h in a time interval of length t (t > 0) is:…”

Section: Request Bound Functionmentioning

confidence: 99%

See 3 more Smart Citations