Heavy-traf c analysis of the discriminatory random-order-of-service discipline U. Ayesta1,2 , A. Izagirre1,3 , I.M. Verloop1,4 BCAM â Basque Center for Applied Mathematics, Derio, Spain IKERBASQUE, Basque Foundation for Science, Bilbao, Spain 3 UPV/EHU, University of the Basque Country, Bilbao, Spain 4 Université de Toulouse, IRIT-CNRS, Toulouse, France tra c setting and for service requirements having nite variance it was shown that the scaled queue length converges to an exponential distribution and that the scaled waiting time is equal in distribution to the product of two independent exponential random variables. More recently, the authors of [4] obtained the waiting time distribution in heavy tra c for certain service requirements having in nite variance. In addition, waiting time tail asymptotics have been obtained for heavy-tailed service time distributions. In [2] the authors derive the relationship between the distribution of the waiting time under ROS and the sojourn time under the processor-sharing discipline. Both ROS and its multi-class generalization are fundamental models with application in various domains, and in particular in telecommunication networks [3]. In the present study, we are interested in the distribution of both the queue length vector and the waiting time for the multi-class queue with
/lp/association-for-computing-machinery/heavy-traffic-analysis-of-the-discriminatory-randomorderofservice-wru4WkgYNN