A large-deviations analysis of the GI/GI/1 SRPT queue
From MaRDI portal
Publication:854992
DOI10.1007/s11134-006-8767-1zbMath1107.60061arXivmath/0505450MaRDI QIDQ854992
Publication date: 20 December 2006
Published in: Queueing Systems (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0505450
Busy period; large deviations; priority queue; sojourn time; shortest remaining processing time; light-tailed service times
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
60F10: Large deviations
Related Items
Heavy-tailed limits for medium size jobs and comparison scheduling, Tail behavior of conditional sojourn times in processor-sharing queues, Sojourn time asymptotics in processor sharing queues with varying service rate, Large deviations of sojourn times in processor sharing queues, Sojourn time asymptotics in processor-sharing queues, Monotonicity in the Limited Processor-Sharing Queue
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sample-path large deviations for tandem and priority queues with Gaussian inputs
- Handling load with less stress
- Calculation of the Laplace transform of the length of the busy period for the M/G/1 queue via martingales
- Asymptotics for M/G/1 low-priority waiting-time tail probabilities
- Big queues.
- Largest weighted delay first scheduling: Large deviations and optimality
- On the average sojourn time under \(M/M/1/\)SRPT
- Large deviations of sojourn times in processor sharing queues
- 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
- SOJOURN TIMES IN THE M/G/1 FB QUEUE WITH LIGHT-TAILED SERVICE TIMES
- On the exact asymptotics of the busy period in GI/G/1 queues
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline