Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 586-605 |
| Number of pages | 20 |
| Journal | Performance Evaluation |
| Volume | 65 |
| Issue number | 8 |
| DOIs | |
| Publication status | Published - 2008 Jul |
Keywords
- Discriminatory processor-sharing
- Egalitarian processor-sharing
- Fairness
- M / M / 1 queue
- Slowdown
ASJC Scopus subject areas
- Software
- Modelling and Simulation
- Hardware and Architecture
- Computer Networks and Communications
Fingerprint Dive into the research topics of 'Slowdown in the M / M / 1 discriminatory processor-sharing queue'. Together they form a unique fingerprint.
Cite this
Cheung, S. K., Kim, B., & Kim, J. (2008). Slowdown in the M / M / 1 discriminatory processor-sharing queue. Performance Evaluation, 65(8), 586-605. https://doi.org/10.1016/j.peva.2007.11.001