The M/G/1 processor sharing queue as the almost sure limit of feedback queues

DOI10.2307/3214834MaRDI QIDQ3350437zbMATH OpenOpenAlexFDO

Authors Jacques Resing, Gerard Hooghiemstra, Michael 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

zbMATH Keywords

coupling techniquescustomer's steady-state sojourn time distributionperformance analysisprocessor sharingtime sharingweak convergence

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)

Recommendations

• scientific article; zbMATH DE number 512420
• GI/G/1 processor sharing queue in heavy traffic
• The M/G/1 queue with processor sharing and its relation to a feedback queue
• Processor-sharing queues: Some progress in analysis
• Sojourn time distribution in some processor-shared queues

Cited in

(16)

• Interoutput times in processor sharing queues with feedback
• 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 model: Transient behavior
• On stochastic bounds for monotonic processor sharing networks
• 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 queue with disasters
• \(M/G/1/MLPS\) compared to \(M/G/1/PS\)
• On a heavy traffic limit theorem for the M/G/1 processor-sharing queue
• Using the M/G/1 queue under processor sharing for exact simulation of queues
• scientific article; zbMATH DE number 3932753 (Why is no real title available?)
• scientific article; zbMATH DE number 512420 (Why is no real title available?)
• Rejoinder on: ``Queueing models for the analysis of communication systems
• Power series approximations for two-class generalized processor sharing systems
• A \(BMAP/PH/1\) queue with feedback operating in a random environment
• Processor sharing: a survey of the mathematical theory

This page was built for publication: The M/G/1 processor sharing queue as the almost sure limit of feedback queues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3350437)