The gi/m/1 processor-sharing queue and its heavy traffic analysis

DOI10.1080/15326349108807197zbMath0736.60092OpenAlexW2022365754MaRDI QIDQ3983733

David L. Jagerman, Bhaskar Sengupta

Publication date: 27 June 1992

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

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

zbMATH Keywords

Laplace-Stieltjes transformsuccessive approximationsheavy traffic limitqueue with processor-sharing discipline

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 (9)

Sojourn time distribution in a MAP/M/1 processor-sharing queue ⋮ The equivalence between processor sharing and service in random order. ⋮ Processor-sharing and random-service queues with semi-Markovian arrivals ⋮ The \(M/G/1\) processor-sharing queue with disasters ⋮ Concavity of the conditional mean sojourn time in the \(M/G/1\) processor-sharing queue with batch arrivals ⋮ Insensitive bounds for the moments of the sojourn time distribution in the \(M/G/1\) processor-sharing queue ⋮ Sojourn time asymptotics in processor-sharing queues ⋮ AnRG-Factorization Approach for a BMAP/M/1 Generalized Processor-Sharing Queue ⋮ A network application model with operational process feature

This page was built for publication: The gi/m/1 processor-sharing queue and its heavy traffic analysis