We consider a queue with multiple K job classes, Poisson arrivals, and exponentially distributed required service times in which a single processor serves according to the discriminatory processor-sharing (DPS) discipline. For this queue, we obtain the first and second moments of the slowdown, which is a measure for queueing fairness. We then provide numerical examples and discuss aspects of the slowdown in the DPS queue.
- Discriminatory processor-sharing
- Egalitarian processor-sharing
- M / M / 1 queue
ASJC Scopus subject areas
- Modelling and Simulation
- Hardware and Architecture
- Computer Networks and Communications