Batch Processor Sharing with Hyper-Exponential Service Time

Natalia Osipova 1
1 MAESTRO - Models for the performance analysis and the control of networks
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : We study Batch Processor-Sharing (BPS) queuing model with hyper-exponential service time distribution and Poisson batch arrival process. One of the main goals to study BPS is the possibility of its application in size-based scheduling, which is used in differentiation between Short and Long flows in the Internet. In the case of hyper-exponential service time distribution we find an analytical expression of the expected conditional response time for the BPS queue. We show, that the expected conditional response time is a concave function of the service time. We apply the received results to the Two Level Processor-Sharing (TLPS) model with hyper-exponential service time distribution and find the expression of the expected response time for the TLPS model. TLPS scheduling discipline can be applied to size-based differentiation in TCP/IP networks and Web server request handling.
Type de document :
Rapport
[Research Report] RR-6180, INRIA. 2007, pp.21
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00144389
Contributeur : Natalia Osipova <>
Soumis le : jeudi 21 juin 2007 - 18:28:49
Dernière modification le : samedi 27 janvier 2018 - 01:31:41
Document(s) archivé(s) le : vendredi 24 septembre 2010 - 10:58:22

Fichiers

rr-6180.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00144389, version 4
  • ARXIV : 0705.0425

Collections

Citation

Natalia Osipova. Batch Processor Sharing with Hyper-Exponential Service Time. [Research Report] RR-6180, INRIA. 2007, pp.21. 〈inria-00144389v4〉

Partager

Métriques

Consultations de la notice

177

Téléchargements de fichiers

103