On a heavy traffic limit theorem for the M/G/1 processor-sharing queue
DOI10.1080/15326349308807276zbMATH Open0777.60095OpenAlexW2038220944MaRDI QIDQ3137348FDOQ3137348
Authors: 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
Recommendations
- The gi/m/1 processor-sharing queue and its heavy traffic analysis
- GI/G/1 processor sharing queue in heavy traffic
- The M/G/1 processor sharing queue as the almost sure limit of feedback queues
- The conditional sojourn time distribution in the \(GI/M/1\) processor- sharing queue in heavy traffic
- Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
Queues and service in operations research (90B22) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cited In (10)
- Processor sharing: a survey of the mathematical theory
- Heavy-traffic limit for the initial content process
- On the transient behavior of the processor sharing queue
- A note on application of the method of supplementary variables to the analysis of a processor sharing system
- 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
- Asymptotic expansions of defective renewal equations with applications to perturbed risk models and processor sharing queues
- Law of Large Number Limits of Limited Processor-Sharing Queues
- A stochastic network with mobile users in heavy traffic
- Tail behavior of conditional sojourn times in processor-sharing queues
This page was built for publication: On a heavy traffic limit theorem for the M/G/1 processor-sharing queue
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137348)
