On a heavy traffic limit theorem for the M/G/1 processor-sharing queue

DOI10.1080/15326349308807276zbMath0777.60095OpenAlexW2038220944MaRDI QIDQ3137348

S. F. Yashkov

Publication date: 15 December 1993

Published in: Communications in Statistics. Stochastic Models (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/15326349308807276

zbMATH Keywords

heavy traffic limit theoremconditional sojourn time distributionqueue with processor-sharing

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (7)

On the transient behavior of the processor sharing queue ⋮ A stochastic network with mobile users in heavy traffic ⋮ Tail behavior of conditional sojourn times in processor-sharing queues ⋮ Asymptotic expansions of defective renewal equations with applications to perturbed risk models and processor sharing queues ⋮ Processor sharing: a survey of the mathematical theory ⋮ SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE ⋮ Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue

This page was built for publication: On a heavy traffic limit theorem for the M/G/1 processor-sharing queue