Sojourn time distribution in the M/M/1 queue with discriminatory processor-sharing

Jeongsim Kim, Bara Kim

Research output: Contribution to journalArticlepeer-review

20 Citations (Scopus)


In this paper, we consider a queue with multiple K job classes, Poisson arrivals, exponentially distributed required service times in which a single processor serves according to the DPS discipline. More precisely, if there are ni class i jobs in the system, i=1,...,K, each class j job receives a fraction αj/∑i=1Kα ini of the processor capacity. For this queue, we obtain a system of equations for joint transforms of the sojourn time and the number of jobs. Using this system of equations we find the moments of the sojourn time as a solution of linear simultaneous equations, which solves an open problem.

Original languageEnglish
Pages (from-to)341-365
Number of pages25
JournalPerformance Evaluation
Issue number4
Publication statusPublished - 2004 Dec

Bibliographical note

Funding Information:
This research was supported by University IT Research Center Project.


  • Discriminatory processor-sharing
  • Egalitarian processor-sharing
  • Joint transform
  • Sojourn time

ASJC Scopus subject areas

  • Software
  • Modelling and Simulation
  • Hardware and Architecture
  • Computer Networks and Communications


Dive into the research topics of 'Sojourn time distribution in the M/M/1 queue with discriminatory processor-sharing'. Together they form a unique fingerprint.

Cite this