Heavy-traffic analysis of a non-preemptive multi-class queue with relative priorities

Ane Izagirre (1) , Urtzi Ayesta (1) , Ina Maria Maaike Verloop (2, 3)

1 LAAS-SARA - Équipe Services et Architectures pour Réseaux Avancés
2 IRIT-RMESS - Réseaux, Mobiles, Embarqués, Sans fil, Satellites
3 CNRS - Centre National de la Recherche Scientifique

We study the steady-state queue-length vector in a multi-class single-server queue with relative priorities. Upon service completion, the probability that the next customer to be served is from class k is controlled by class- dependent weights. Once a customer has started service, it is served without interruption until completion. This is a generalization of the random-order-of-service discipline. We investigate the system in a heavy-traffic regime. We first establish a state-space collapse for the scaled queue length vector, that is, in the limit the scaled queue length vector is distributed as the product of an exponentially distributed random variable and a deterministic vector. As a direct consequence, we obtain that the scaled number of customers in the system reduces as classes with smaller mean service requirement obtain relatively larger weights. We then show that the scaled waiting time of a class-k customer is distributed as the product of two exponentially distributed random variables. This allows us to determine the value of the weights that minimize the m-th moment of the scaled waiting time for a customer of arbitrary class. We simulate a system with two different classes of customers in order to numerically verify some of the analytical results.

Mots clés: state-space collapse; waiting time; random order of service; heavy traffic; scheduling

Domaines: Recherche opérationnelle [math.OC]

Ane Izagirre, Urtzi Ayesta, Ina Maria Maaike Verloop. Heavy-traffic analysis of a non-preemptive multi-class queue with relative priorities. Probability in the Engineering and Informational Sciences, 2015, 29 (2), pp.153-180. ⟨hal-00790846v2⟩