SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
From MaRDI portal
Publication:3591538
DOI10.1017/S0269964806060268zbMath1183.60035OpenAlexW2105718791MaRDI QIDQ3591538
Regina Egorova, Onno J. Boxma, Bert Zwart
Publication date: 11 September 2007
Published in: Probability in the Engineering and Informational Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0269964806060268
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22)
Related Items (11)
A large-deviations analysis of the GI/GI/1 SRPT queue ⋮ Using the \(M/G/1\) queue under processor sharing for exact simulation of queues ⋮ Tail behavior of conditional sojourn times in processor-sharing queues ⋮ Processor sharing: a survey of the mathematical theory ⋮ Tail asymptotics of the waiting time and the busy period for the \(\mathrm{M}/\mathrm{G}/1/K\) queues with subexponential service times ⋮ Sojourn time asymptotics in processor sharing queues with varying service rate ⋮ Connecting Renewal Age Processes with M/D/1 and M/D/∞ Queues Through Stick Breaking ⋮ Asymptotic expansions for the conditional sojourn time distribution in the \(M/M/1\)-PS queue ⋮ Asymptotic expansions for the sojourn time distribution in the \(M/G/1\)-PS queue ⋮ Unnamed Item ⋮ Sojourn time asymptotics in processor-sharing queues
Uses Software
Cites Work
- Unnamed Item
- The Fourier-series method for inverting transforms of probability distributions
- Waiting-time tail probabilities in queues with long-tail service-time distributions
- A decomposition theorem and related results for the discriminatory processor sharing queue
- The waiting time distribution for the random order service \(M/M/1\) queue
- Asymptotics for M/G/1 low-priority waiting-time tail probabilities
- The equivalence between processor sharing and service in random order.
- Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
- Tails of waiting times and their bounds
- On a heavy traffic limit theorem for the M/G/1 processor-sharing queue
- The sojourn-time distribution in the M/G/1 queue by processor sharing
- Tail asymptotics for processor-sharing queues
- Some Time-Dependent Properties of Symmetric M/G/1 Queues
- Analysis of A time‐shared processor
- Time-shared Systems
- Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue
This page was built for publication: SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE