FP/FIFO scheduling: deterministic versus probabilistic QoS guarantees and p-schedulability

Leila Azouz Saidane 1 Skander Azzaz 1 Steven Martin 2 Pascale Minet 3
3 HIPERCOM - High performance communication
Inria Paris-Rocquencourt, UP11 - Université Paris-Sud - Paris 11, Inria Saclay - Ile de France, X - École polytechnique, CNRS - Centre National de la Recherche Scientifique : UMR
Abstract : In this paper, we focus on applications having quantitative QoS (Quality of Service) requirements on their end-to-end response time. Two types of quantitative QoS garantees can be delivered by a network, deterministic and probabilistic. The deterministic approach is based on a worst case analysis. The probabilistic approach uses a mathematical model to obtain the probability that the response time exceeds a given value. We assume that flows are scheduled according to non-preemptive FP/FIFO. The packet with the highest fixed priority is scheduled first. If two packets share the same fixed priority, the packet arrived first on the node considered is scheduled first. We compare deterministic and probabilistic QoS guarantees and introduce the concept of p-schedulabilty: the QoS requested by all flows is met with probability p.
Type de document :
Communication dans un congrès
IEEE International Conference on Communications - ICC 2007, Jun 2007, Glasgow, Scotland / Great Britain, 2007
Liste complète des métadonnées

https://hal.inria.fr/inria-00128777
Contributeur : Pascale Minet <>
Soumis le : vendredi 2 février 2007 - 16:10:48
Dernière modification le : vendredi 25 mai 2018 - 12:02:05

Identifiants

  • HAL Id : inria-00128777, version 1

Collections

Citation

Leila Azouz Saidane, Skander Azzaz, Steven Martin, Pascale Minet. FP/FIFO scheduling: deterministic versus probabilistic QoS guarantees and p-schedulability. IEEE International Conference on Communications - ICC 2007, Jun 2007, Glasgow, Scotland / Great Britain, 2007. 〈inria-00128777〉

Partager

Métriques

Consultations de la notice

1195