In this paper, we are interested in real-time flows requiring quantitative and deterministic Quality of Service (QoS) guarantees. We focus more particularly on two QoS parameters: the worst case end-to-end response time and jitter. We consider a non-preemptive scheduling of flows, called FP/DP*, combining fixed priority and dynamic priority, where the dynamic priority of a flow packet is assigned on the first node visited by the packet in the network. Examples of such a scheduling are FP/FIFO* and FP/EDF*. With any flow is associated a fixed priority denoting the importance of the flow from the user point of view. The arbritation between packets having the same fixed priority is done according to their dynamic priority. A packet can be transmitted only if (i) there is no packet having a higher fixed priority and (ii) there is no packet having a higher dynamic priority. A classical approach used to compute the worst case end-to-end response time is the holistic one, but it leads to pessimistic upper bounds. We propose the trajectory approach to improve the accuracy of the results. Indeed, the trajectory approach only considers worst case scenarios experienced by a flow along its trajectory. It then eliminates scenarios that cannot occur in the network
