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

Citations

WEB OF SCIENCE

1
Citations

SCOPUS

1

초록

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. (c) 2007 Elsevier B.V. All rights reserved.

키워드

slowdownfairnessM/M/1 queuediscriminatory processor-sharingegalitarian processor-sharingSOJOURN TIME DISTRIBUTIONLENGTH DISTRIBUTIONSYSTEMSMODELS
제목
Slowdown in the M/M/1 discriminatory processor-sharing queue
저자
Cheung, Sing-KongKim, BaraKim, Jeongsim
DOI
10.1016/j.peva.2007.11.001
발행일
2008-07
유형
Article
저널명
Performance Evaluation
65
8
페이지
586 ~ 605