Using memo recursive computation in the Trajectory approach for the worst-case delay analysis of AFDX networks

This paper presents the new result in the Trajectory approach when considering more than one packet of a sporadic flow is overstocked on an output port for an AFDX network, using the FIFO assumption. The principal contribution is to compute upper bounds of end-to-end delays for the processing flows by the recursive calculation of interference time windows. The paper proposes a memo recursive computation to reduce the time complexity. Finally, it is shown the comparison of three methods for the maximum delays: Network Calculus, memo recursive computation in Trajectory approach and simulation approach.