Worst case end-to-end response times of flows scheduled with FP/FIFO

Authors:
Steven Martin;Pascale Minet
Affiliations:
LRI, Univ. Paris-Sud, Orsay, France;INRIA Rocquencourt,Le Chesnay, France
Venue:
ICNICONSMCL '06 Proceedings of the International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies
Year:
2006

Citing 0
Cited 2

Probabilistic or deterministic QoS guarantees for flows scheduled with FP/DM

PDCN'07 Proceedings of the 25th conference on Proceedings of the 25th IASTED International Multi-Conference: parallel and distributed computing and networks
Applying Trajectory approach with static priority queuing for improving the use of available AFDX resources

Real-Time Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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/FIFO, based on fixed priorities. On each node, packets are scheduled according to their fixed priority, if several packets share the same one, they are scheduled according to their arrival time on the node considered. The fixed priority associated with a flow denotes the importance of the flow from the user point of view. The scheduling FP/FIFO is the most common implementation of FP. We show how to take into account the FIFO arbitration in the worst case analysis, based on the trajectory approach, allowing to establish a bound on the worst case end-to-end response time of any flow in the network. Finally, we present an example illustrating our results.