On queues with impatience: stability, and the optimality of earliest deadline first

DOI10.1007/s11134-013-9342-1zbMath1277.90034OpenAlexW1983111238MaRDI QIDQ386347

Pascal Moyal

Publication date: 9 December 2013

Published in: Queueing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11134-013-9342-1

zbMATH Keywords

earliest deadline firstqueues with impatient customersstochastic recursive sequences

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Stationary stochastic processes (60G10) 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

Fluid Limits of G/G/1+G Queues Under the Nonpreemptive Earliest-Deadline-First Discipline, Law of large numbers for the many-server earliest-deadline-first queue, Personalized queues: the customer view, via a fluid model of serving least-patient first, Server assignment policies in queues with customer abandonments, Fluid limits for earliest-deadline-first networks, A Skorokhod map on measure-valued paths with applications to priority queues, Perfect simulation of M/G/c queues, Coupling in the queue with impatience: case of several servers, Increases or discounts: price strategies based on customers' patience times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heavy traffic analysis for EDF queues with reneging
• Convex comparison of service disciplines in real time queues
• On optimal lateness and tardiness scheduling in real-time systems
• Two ergodicity criteria for stochastically recursive sequences
• The fluid limit of a heavily loaded processor sharing queue
• Real-time queues in heavy traffic with earliest-deadline-first queue discipline
• A functional central limit theorem for the \(M/GI/\infty \) queue
• Stochastic Modeling and Analysis of Telecom Networks
• Fluid Limits for Processor-Sharing Queues with Impatience
• Single-server queues with impatient customers
• The queue with impatience: construction of the stationary workload under FIFO
• Stochastic Scheduling with Release Dates and Due Dates
• Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
• A Real-Time System Design Methodology^*
• Queuing with Impatient Customers and Ordered Service
• Stability of a Processor-Sharing Queue with Varying Throughput
• Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment