Waiting times in queues with relative priorities

This paper determines the mean waiting times for a single server multi-class queueing model with Poisson arrivals and relative priorities. If the server becomes idle, the probability that the next job is from class-i is proportional to the product between the number of class-i jobs present and their priority parameter.

[1]  Alan Cobham,et al.  Priority Assignment in Waiting Line Problems , 1954, Oper. Res..

[2]  Isi Mitrani,et al.  Sharing a Processor Among Many Job Classes , 1980, JACM.

[3]  van der J Jan Wal,et al.  Equilibrium Strategies for Processor Sharing and Random Queues with Relative Priorities , 1997, Probability in the Engineering and Informational Sciences.

[4]  Isi Mitrani,et al.  Complete parameterized families of job scheduling strategies , 2004, Acta Informatica.

[5]  Eitan Altman,et al.  A survey on discriminatory processor sharing , 2006, Queueing Syst. Theory Appl..