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 single network element: the first one considers the global aggregated flow, and the second one considers each individual flow, assuming FIFO policy. Some configurations are tested, and the first results obtained are in almost all cases better than already known methods.