Insensitive bounds for the moments of the sojourn time distribution in the M/G/1 processor-sharing queue
article
This paper studies the M/G/1 processor-sharing (PS) queue, in particular the sojourn time distribution conditioned on the initial job size. Although several expressions for the Laplace-Stieltjes transform (LST) are known, these expressions are not suitable for computational purposes. This paper derives readily applicable insensitive bounds for all moments of the conditional sojourn time distribution. The instantaneous sojourn time, i.e., the sojourn time of an infinitesimally small job, leads to insensitive upper bounds requiring only knowledge of the traffic intensity and the initial job size. Interestingly, the upper bounds involve polynomials with so-called Eulerian numbers as coefficients. In addition, stochastic ordering and moment ordering results for the sojourn time distribution are obtained. © Springer Science + Business Media, LLC 2006.
Topics
TNO Identifier
239288
Source
Queueing Systems, 53(1-2), pp. 7-18.
Pages
7-18
Files
To receive the publication files, please send an e-mail request to TNO Repository.