Slowdown in the $M/M/1$ discriminatory processor-sharing queue

S.K. Cheung, Bara Kim, Jeongsim Kim

Research output: Contribution to journalArticleAcademicpeer-review

1 Citation (Scopus)


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 languageUndefined
Article number10.1016/j.peva.2007.11.001
Pages (from-to)586-605
Number of pages20
JournalPerformance evaluation
Issue number274/8
Publication statusPublished - 2008


  • IR-62318
  • METIS-250990
  • EWI-12791
  • MSC-60K25

Cite this