Sojourn time distribution in the M/M/1 queue with discriminatory processor-sharing |
| |
Authors: | Jeongsim Kim Bara Kim |
| |
Affiliation: | Department of Mathematics and Telecommunication Mathematics Research Center, Korea University, 1, Anam-dong, Sungbuk-ku, Seoul 136-701, South Korea |
| |
Abstract: | 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=1Kini 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. |
| |
Keywords: | Discriminatory processor-sharing Egalitarian processor-sharing Sojourn time Joint transform |
本文献已被 ScienceDirect 等数据库收录! |
|