Fluid limits for earliest-deadline-first networks

DOI10.1016/J.SPA.2022.12.006OpenAlexW3087358094MaRDI QIDQ2685907

Rami Atar, Yonatan Shadmi

Publication date: 23 February 2023

Published in: Stochastic Processes and their Applications (Search for Journal in Brave)

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

zbMATH Keywords

generalized Jackson networksearliest deadline firstfluid limitsmeasure-valued processesmeasure-valued Skorokhod map

Mathematics Subject Classification ID

Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Random measures (60G57)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On queues with impatience: stability, and the optimality of earliest deadline first
• Heavy traffic analysis for EDF queues with reneging
• Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling
• Reflected Brownian motion on an orthant
• Large deviations and queueing networks: Methods for rate function identification
• Law of large numbers for the many-server earliest-deadline-first queue
• A Skorokhod map on measure-valued paths with applications to priority queues
• The fluid limit of a heavily loaded processor sharing queue
• Real-time queues in heavy traffic with earliest-deadline-first queue discipline
• Earliest-deadline-first service in heavy-traffic acyclic networks.
• On positive Harris recurrence of multiclass queueing networks: A unified approach via fluid limit models
• Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions
• Fluid limits for shortest job first with aging
• A Subsidy-Surplus Model and the Skorokhod Problem in an Orthant
• Hard Real-Time Computing Systems
• Open Queueing Networks in Heavy Traffic
• Fluid Limits of G/G/1+G Queues Under the Nonpreemptive Earliest-Deadline-First Discipline
• Double Skorokhod Map and Reneging Real-Time Queues
• Optimal scheduling policies for a class of queues with customer deadlines to the beginning of service
• Conditioning as disintegration
• Applying queueing theory to the study of emergency department operations: a survey and a discussion of comparable simulation studies
• Fluid Limits for Many-Server Systems with Reneging Under a Priority Policy
• Stability of earliest-due-date, first-served queueing networks

This page was built for publication: Fluid limits for earliest-deadline-first networks