Tightening end to end delay upper bound for AFDX network calculus with rate latency FIFO servers using network calculus


This paper presents some new results in network calculus designed to improve the computation of end to end bounds for an AFDX network, using the FIFO assumption. The formal contribution is to allow to handle shaped leaky buckets flows traversing simple rate-latency network elements. Two new results are presented when a sum of some shaped flows crosses one… (More)

8 Figures and Tables



Citations per Year

80 Citations

Semantic Scholar estimates that this publication has 80 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics