Fluid Limits of G/G/1+G Queues Under the Nonpreemptive Earliest-Deadline-First Discipline

DOI10.1287/moor.2014.0690zbMath1327.60175arXiv1305.2587MaRDI QIDQ3449454

Rami Atar, Haya Kaspi, Anup Biswas

Publication date: 4 November 2015

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.2587

zbMATH Keywords

law of large numbers; fluid limits; measure-valued processes; \(\mathrm{G}/\mathrm{G}/1+\mathrm{G}\) queues; earliest-deadline-first discipline

Mathematics Subject Classification ID

60K25: Queueing theory (aspects of probability theory)

90B22: Queues and service in operations research

60F15: Strong limit theorems

60G57: Random measures

60F17: Functional limit theorems; invariance principles

Related Items

Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks, 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, Stability of linear EDF networks with resource sharing, A Skorokhod map on measure-valued paths with applications to priority queues, Asymptotic optimality of the generalized \(c\mu\) rule under model uncertainty, Separation versus diffusion in a two species system, Fluid limits for earliest-deadline-first networks

Cites Work

• On queues with impatience: stability, and the optimality of earliest deadline first
• Heavy traffic analysis for EDF queues with reneging
• Fluid limits of many-server queues with reneging
• Law of large numbers limits for many-server queues
• The Skorokhod problem in a time-dependent interval
• The fluid limit of a heavily loaded processor sharing queue
• Real-time queues in heavy traffic with earliest-deadline-first queue discipline
• A diffusion approximation for a GI/GI/1 queue with balking or reneging
• Approximating the GI/GI/1+GI Queue with a Nonlinear Drift Diffusion: Hazard Rate Scaling in Heavy Traffic
• Fluid Limits for Shortest Remaining Processing Time Queues
• Law of Large Number Limits of Limited Processor-Sharing Queues
• Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
• Fluid Limits for Many-Server Systems with Reneging Under a Priority Policy
• Unnamed Item