Schedulability analysis of flows scheduled with FIFO: application to the expedited forwarding class

  • Authors:
  • Steven Martin;Pascale Minet

  • Affiliations:
  • LRI, Paris-Sud University, Orsay, France;INRIA Rocquencourt, Le Chesnay, France

  • Venue:
  • IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we are interested in real-time flows requiring quantitative and deterministic QoS (Quality of Service) guarantees. We focus more particularly on two QoS parameters: the worst case end-to-end response time and jitter. We consider a FIFO (First In First Out) scheduling of flows. The FIFO scheduling is the simplest one to implement and very used. We first establish a bound on the worst case end-to-end response time of any flow in the network, using the trajectory approach. We present an example illustrating our results. Finally, we show how to apply these results to the EF (Expedited Forwarding) class in a DiffServ (Differentiated Services) architecture.