Probabilistic upper bounds for heterogeneous flows using a static priority queueing on an AFDX network

AFDX (avionics full duplex switched Ethernet, AR-INC 664) developed for the Airbus A380 represents a major upgrade in both bandwidth and capability. Its reliance on Ethernet technology helps to lower some implementation costs, but guaranteed service presents challenges for system designers. An analysis of end-to-end transfer delays through the network is required in order to determine upper bounds. The stochastic network calculus approach analytically determines worst-case probabilistic upper bounds in the context of homogeneous avionics flows without priorities. Such upper bounds can be exceeded with a given probability P_UB, and are relevant in the context of avionics, where functions are designed to give accurate results even if they miss some frames. Nowadays, there is a need to handle new classes of traffics with different priorities (voice, video, best-effort, ...) on the same AFDX network with no consequences on existing avionic flows. This paper presents the application of the stochastic network calculus approach in the context of a static priority queueing service discipline and evaluates the influence of the service discipline on analytical probabilistic upper bounds.