Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Conditional sojourn time of optimal scheduling policy in a multi-class single-server queue
 

Summary: Conditional sojourn time of optimal scheduling
policy in a multi-class single-server queue
K.E. Avrachenkov1
, U. Ayesta2,3
, N. Osipova
1
INRIA Sophia Antipolis,
2004, route des Lucioles ­ BP 93 - 06902 Sophia Antipolis
2
BCAM ­ Basque Center for Applied Mathematics
Bizkaia Technology Park 500, 48170 Derio, Spain
3
IKERBASQUE ­ Basque Foundation for Science, 48011 Bilbao, Spain
Abstract. Based on the groundbreaking result of Gittins on the multi-
armed bandit problem we provide a characterization of the optimal non-
anticipating scheduling policy in a multi-class single-server queue. We
apply Gittins' framework to characterize the optimal policy when the ser-
vice time distribution of the various classes belong to the set of Decreas-
ing Hazard Rate (DHR) distributions, like Pareto or hyper-exponential.
When there is only one class it is known that the Least Attained Ser-

  

Source: Ayesta, Urtzi - Laboratoire d'Analyse et d'Architecture des Systèmes du CNRS

 

Collections: Engineering