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

DOI10.1287/moor.2014.0690zbMath1327.60175arXiv1305.2587OpenAlexW2118260079MaRDI 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 numbersfluid limitsmeasure-valued processes\(\mathrm{G}/\mathrm{G}/1+\mathrm{G}\) queuesearliest-deadline-first discipline

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Strong limit theorems (60F15) Random measures (60G57) Functional limit theorems; invariance principles (60F17)

Related Items (8)

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 ⋮ Fluid limits for earliest-deadline-first networks ⋮ 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 ⋮ Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks

Cites Work

• Unnamed Item
• 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

This page was built for publication: Fluid Limits of G/G/1+G Queues Under the Nonpreemptive Earliest-Deadline-First Discipline