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

Sing Kong Cheung; Bara Kim; Jeongsim Kim

doi:10.1016/j.peva.2007.11.001

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

Sing Kong Cheung, Bara Kim, Jeongsim Kim

Department of Mathematics

Research output: Contribution to journal › Article › peer-review

1 Citation (Scopus)

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	https://doi.org/10.1016/j.peva.2007.11.001
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

Access to Document

10.1016/j.peva.2007.11.001

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

@article{6559a52e5d2e4396b366dc7b3f43e10a,

title = "Slowdown in the M / M / 1 discriminatory processor-sharing queue",

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.",

keywords = "Discriminatory processor-sharing, Egalitarian processor-sharing, Fairness, M / M / 1 queue, Slowdown",

author = "Cheung, {Sing Kong} and Bara Kim and Jeongsim Kim",

note = "Funding Information: For the first author this work has been funded by the cooperation agreement between the Korea Science and Engineering Foundation (KOSEF), and the Netherlands Organization for Scientific Research (NWO). For the second author this research was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute of Information Technology Assessment). For the second and the third authors this work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD) (KRF-2006-312-C00470). ",

year = "2008",

month = jul,

doi = "10.1016/j.peva.2007.11.001",

language = "English",

volume = "65",

pages = "586--605",

journal = "Performance Evaluation",

issn = "0166-5316",

publisher = "Elsevier",

number = "8",

}

TY - JOUR

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

AU - Cheung, Sing Kong

AU - Kim, Bara

AU - Kim, Jeongsim

N1 - Funding Information: For the first author this work has been funded by the cooperation agreement between the Korea Science and Engineering Foundation (KOSEF), and the Netherlands Organization for Scientific Research (NWO). For the second author this research was supported by the MIC (Ministry of Information and Communication), Korea, under the ITRC (Information Technology Research Center) support program supervised by the IITA (Institute of Information Technology Assessment). For the second and the third authors this work was supported by the Korea Research Foundation Grant funded by the Korean Government (MOEHRD) (KRF-2006-312-C00470).

PY - 2008/7

Y1 - 2008/7

N2 - 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.

AB - 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.

KW - Discriminatory processor-sharing

KW - Egalitarian processor-sharing

KW - Fairness

KW - M / M / 1 queue

KW - Slowdown

UR - http://www.scopus.com/inward/record.url?scp=44249122436&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=44249122436&partnerID=8YFLogxK

U2 - 10.1016/j.peva.2007.11.001

DO - 10.1016/j.peva.2007.11.001

M3 - Article

AN - SCOPUS:44249122436

VL - 65

SP - 586

EP - 605

JO - Performance Evaluation

JF - Performance Evaluation

SN - 0166-5316

IS - 8

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this