Batch Processor Sharing with Hyper-Exponential Service Time - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2007

Batch Processor Sharing with Hyper-Exponential Service Time

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.
Fichier principal
Vignette du fichier
rr-6180.pdf (255.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00144389 , version 1 (03-05-2007)
inria-00144389 , version 2 (03-05-2007)
inria-00144389 , version 3 (04-05-2007)
inria-00144389 , version 4 (21-06-2007)

Identifiers

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

Cite

Natalia Osipova. Batch Processor Sharing with Hyper-Exponential Service Time. [Research Report] RR-6180, INRIA. 2007, pp.21. ⟨inria-00144389v4⟩
106 View
95 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More