Optimal Choice of Threshold in Two Level Processor Sharing

Abstract : We analyze the Two Level Processor Sharing (TLPS) scheduling discipline with the hyper-exponential job size distribution and with the Poisson arrival process. TLPS is a convenient model to study the benefit of the file size based differentiation in TCP/IP networks. In the case of the hyper-exponential job size distribution with two phases, we find a closed form analytic expression for the expected sojourn time and an approximation for the optimal value of the threshold that minimizes the expected sojourn time. In the case of the hyper-exponential job size distribution with more than two phases, we derive a tight upper bound for the expected sojourn time conditioned on the job size. We show that when the variance of the job size distribution increases, the gain in system performance increases and the sensitivity to the choice of the threshold near its optimal value decreases.
Type de document :
Rapport
[Research Report] RR-6215, INRIA. 2007, pp.19
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00153966
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 13 juin 2007 - 11:44:42
Dernière modification le : jeudi 11 janvier 2018 - 16:57:57
Document(s) archivé(s) le : mardi 21 septembre 2010 - 13:27:03

Fichiers

RR-6215.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00153966, version 2
  • ARXIV : 0706.1563

Collections

Citation

Konstantin Avrachenkov, Patrick Brown, Natalia Osipova. Optimal Choice of Threshold in Two Level Processor Sharing. [Research Report] RR-6215, INRIA. 2007, pp.19. 〈inria-00153966v2〉

Partager

Métriques

Consultations de la notice

146

Téléchargements de fichiers

82