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

Simple item page
dc.creatorYashkov, S. F.
dc.date2005-12-13
dc.date.accessioned2026-07-07T06:55:09Z
dc.date.available2026-07-07T06:55:09Z
dc.descriptionWe 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.
dc.description10 pages
dc.identifierhttps://arxiv.org/abs/math/0512281
dc.identifierhttp://arxiv.org/abs/math/0512281
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/106192
dc.subjectProbability
dc.subject60K25 (Primary) 90B22 (Secondary)
dc.titleExplicit formulas for the moments of the sojourn time in the M/G/1 processor sharing queue with permanent jobs
dc.typetext

Files

Collections

arXiv