Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Optimal Choice of Threshold in Two Level Processor Sharing Konstantin Avrachenkova, Patrick Brownb, Natalia Osipovaa, 1
 

Summary: Optimal Choice of Threshold in Two Level Processor Sharing
Konstantin Avrachenkova, Patrick Brownb, Natalia Osipovaa, 1
a
INRIA Sophia Antipolis, France, e-mail: {K.Avrachenkov,N.Osipova}@sophia.inria.fr
b
France Telecom R&D, France, e-mail: Patrick.Brown@orange-ft.com
Abstract
We analyze the Two Level Processor Sharing (TLPS) scheduling discipline with hyper-
exponential distribution for the job size and with Poisson arrival process. TLPS is a convenient
model to represent the file size based differentiation in TCP/IP networks. 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.
1 Introduction and Model Formulation
We study the Two Level Processor Sharing (TLPS) scheduling discipline with hyper-exponential
distribution for the job size. The TLPS discipline was first introduced in [5]. TLPS is a con-
venient model to represent the file size based differentiation in TCP/IP networks [2]. It is
assumed that jobs arrive to the system according to a Poisson process with rate . Let be
a given threshold. If there are jobs in the system that attained a service less than , they
are assigned to the high priority queue which is served according to Processor Sharing (PS)
discipline. If in addition there are jobs with attained service greater than , those jobs wait

  

Source: Avrachenkov, Konstantin - INRIA Sophia Antipolis

 

Collections: Computer Technologies and Information Sciences