FP/FIFO scheduling: coexistence of deterministic and probabilistic QoS guarantees

Pascale Minet 1 Steven Martin 2 Leila Azouz Saidane 3 Skander Azzaz 3
1 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 (or jitter). We propose a solution allowing the coexistence of two types of quantitative QoS garantees, deterministic and probabilistic, while providing a high resource utilization. Our solution combines the advantages of the deterministic approach and the probabilistic one. 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 priority, the packet arrived first is scheduled first. We make no particular assumption concerning the flow priority and the nature of the QoS guarantee requested by the flow. An admission control derived from these results is then proposed, allowing each flow to receive a quantitative QoS guarantee adapted to its QoS requirements. An example illustrates the merits of the coexistence of deterministic and probabilistic QoS guarantees.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 2007, 9 (1), pp.23--46
Liste complète des métadonnées

Littérature citée [15 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00966514
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : mercredi 26 mars 2014 - 16:59:34
Dernière modification le : mardi 17 avril 2018 - 11:34:32
Document(s) archivé(s) le : jeudi 26 juin 2014 - 11:57:08

Fichier

510-2372-1-PB.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00966514, version 1

Collections

Citation

Pascale Minet, Steven Martin, Leila Azouz Saidane, Skander Azzaz. FP/FIFO scheduling: coexistence of deterministic and probabilistic QoS guarantees. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2007, 9 (1), pp.23--46. 〈hal-00966514〉

Partager

Métriques

Consultations de la notice

863

Téléchargements de fichiers

1191