Sojourn time asymptotics in processor sharing queues with varying service rate
From MaRDI portal
Publication:2454682
DOI10.1007/s11134-007-9026-9zbMath1125.60097OpenAlexW2168256736WikidataQ126260833 ScholiaQ126260833MaRDI QIDQ2454682
Bert Zwart, Regina Egorova, M. R. H. Mandjes
Publication date: 16 October 2007
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11134-007-9026-9
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 (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A large-deviations analysis of the GI/GI/1 SRPT queue
- The waiting time distribution for the random order service \(M/M/1\) queue
- Large deviations and the generalized processor sharing scheduling for a two-queue system
- The equivalence between processor sharing and service in random order.
- Sojourn time asymptotics in the \(M/G/1\) processor sharing queue
- Sample path large deviations and intree networks
- Large deviations of sojourn times in processor sharing queues
- Sojourn time asymptotics in processor-sharing queues
- A new approach to the M/G/1 processor-sharing queue
- The sojourn-time distribution in the M/G/1 queue by processor sharing
- SOJOURN TIME TAILS IN THE M/D/1 PROCESSOR SHARING QUEUE
- Logarithmic asymptotics for steady-state tail probabilities in a single-server queue
- Applied Probability and Queues
- On the exact asymptotics of the busy period in GI/G/1 queues
- Perturbation analysis of a variable M/M/1 queue: a probabilistic approach
- Large Deviation Analysis of Subexponential Waiting Times in a Processor-Sharing Queue
This page was built for publication: Sojourn time asymptotics in processor sharing queues with varying service rate
