| Abstract: | In this paper, we are interested in providing deterministic end‐to‐end guarantees to real‐time flows in a distributed system. We focus on the end‐to‐end response time, quality of service (QoS) parameter of the utmost importance for such flows. We assume that each node uses a Fixed Priority scheduling. We determine a bound on the end‐to‐end response time of any real‐time flow with a worst case analysis using the trajectory approach. We establish new results that we compare with those provided by the classical holistic approach for flows visiting the same sequence of nodes. These results show that the trajectory approach is less pessimistic than the holistic one. Moreover, the bound provided by our worst‐case analysis is reached in various configurations, as shown in the examples presented. Copyright © 2004 John Wiley & Sons, Ltd. |
