On queues with impatience: stability, and the optimality of Earliest Deadline First
- 5 February 2013
- journal article
- research article
- Published by Springer Science and Business Media LLC in Queueing Systems
- Vol. 75 (2-4), 211-242
- https://doi.org/10.1007/s11134-013-9342-1
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Heavy traffic analysis for EDF queues with renegingThe Annals of Applied Probability, 2011
- The queue with impatience: construction of the stationary workload under FIFOJournal of Applied Probability, 2010
- A functional central limit theorem for the M/GI/∞ queueThe Annals of Applied Probability, 2008
- Stability of a Processor-Sharing Queue with Varying ThroughputJournal of Applied Probability, 2008
- The fluid limit of a heavily loaded processor sharing queueThe Annals of Applied Probability, 2002
- Real-time queues in heavy traffic with earliest-deadline-first queue disciplineThe Annals of Applied Probability, 2001
- Two ergodicity criteria for stochastically recursive sequencesActa Applicandae Mathematicae, 1994
- Optimal scheduling policies for a class of queues with customer deadlines to the beginning of serviceJournal of the ACM, 1988
- Single-server queues with impatient customersAdvances in Applied Probability, 1984
- The stability of a queue with non-independent inter-arrival and service timesMathematical Proceedings of the Cambridge Philosophical Society, 1962