arXiv:math/0512281 Abstract

arXiv:math/0512281 [math.PR]Abstract References Reviews Resources

Explicit formulas for the moments of the sojourn time in the M/G/1 processor sharing queue with permanent jobs

Published 2005-12-13Version 1

We give some representation about recent achievements in analysis of the M/G/1 queue with egalitarian processor sharing discipline (EPS). The new formmulas are derived for the j-th moments (j=1,2,...) of the (conditional) stationary sojourn time in the M/G/1--EPS queue with K (K=0,1,2,...) permanent jobs of infinite size. We discuss also how to simplify the computations of the moments.

Comments: 10 pages

Categories: math.PR

Subjects: 60K25, 90B22

Keywords: processor sharing queue, permanent jobs, explicit formulas, egalitarian processor sharing discipline, stationary sojourn time

Related articles: Most relevant | Search more

arXiv:math/0405298 [math.PR] (Published 2004-05-14)

Diffusion approximation for a processor sharing queue in heavy traffic

H. Christian Gromoll

arXiv:0707.4600 [math.PR] (Published 2007-07-31)

Heavy traffic limit for a processor sharing queue with soft deadlines

H. Christian Gromoll, Łukasz Kruk

arXiv:0905.3700 [math.PR] (Published 2009-05-22)