On the equivalence between multiclass PS-type scheduling policies

Konstantin Avrachenkov 1 Tejas Bodas 2
1 NEO - Network Engineering and Operations
CRISAM - Inria Sophia Antipolis - Méditerranée
2 LAAS-SARA - Équipe Services et Architectures pour Réseaux Avancés
LAAS - Laboratoire d'analyse et d'architecture des systèmes [Toulouse]
Abstract : Consider a single server queue serving a multiclass population. Some popular scheduling policies for such a system (and of interest in this paper) are the discriminatory processor sharing (DPS), discriminatory random order service (DROS), generalized processor sharing (GPS) and weighted fair queueing (WFQ). The aim of this paper is to show a certain equivalence between these scheduling policies for the special case when the multiclass population have identical and exponential service requirements. In fact, we show the equivalence between two broader classes of policies that generalize the above mentioned four policies. We specifically show that the sojourn time distribution for a customer of a particular class in a system with the DPS (GPS) scheduling policy is a constant multiple of the waiting time distribution of a customer of the same class in a system with the DROS (respectively WFQ) policy.
Document type :
Preprints, Working Papers, ...
Rapport LAAS n° 17108. 2017
Liste complète des métadonnées

Cited literature [17 references]  Display  Hide  Download

Contributor : Tejas Bodas <>
Submitted on : Monday, April 24, 2017 - 7:24:34 AM
Last modification on : Thursday, January 11, 2018 - 4:47:54 PM
Document(s) archivé(s) le : Tuesday, July 25, 2017 - 1:46:00 PM


Files produced by the author(s)


  • HAL Id : hal-01502565, version 2
  • ARXIV : 1704.01722


Konstantin Avrachenkov, Tejas Bodas. On the equivalence between multiclass PS-type scheduling policies. Rapport LAAS n° 17108. 2017. 〈hal-01502565v2〉



Record views


Files downloads