The M/G/1 processor sharing queue as the almost sure limit of feedback queues
From MaRDI portal
Publication:3350437
DOI10.2307/3214834zbMath0726.60093OpenAlexW2086477984MaRDI QIDQ3350437
Gerard Hooghiemstra, J. A. C. Resing, Michael S. Keane
Publication date: 1990
Published in: Journal of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/3214834
weak convergenceperformance analysisprocessor sharingcoupling techniquestime sharingcustomer's steady-state sojourn time distribution
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (9)
Power series approximations for two-class generalized processor sharing systems ⋮ Rejoinder on: ``Queueing models for the analysis of communication systems ⋮ Processor sharing: a survey of the mathematical theory ⋮ The \(M/G/1\) queue with processor sharing and its relation to a feedback queue ⋮ Mathematical problems in the theory of processor-sharing queueing systems ⋮ The \(M/G/1\) processor-sharing queue with disasters ⋮ Analysis of a Markovian feedback queue with multi-class customers and its application to the weighted round-robin queue ⋮ The M/G/1 processor-sharing model: Transient behavior ⋮ A \(BMAP/PH/1\) queue with feedback operating in a random environment
This page was built for publication: The M/G/1 processor sharing queue as the almost sure limit of feedback queues
