A Skorokhod map on measure-valued paths with applications to priority queues

DOI10.1214/17-AAP1309zbMath1391.60220arXiv1604.04874WikidataQ130161060 ScholiaQ130161060MaRDI QIDQ1751972

Anup Biswas, Rami Atar, Kavita Ramanan, Haya Kaspi

Publication date: 25 May 2018

Published in: The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

law of large numbersfluid modelsfluid limitsmeasure-valued processespriority queueingearliest-deadline-firstSkorokhod mapmeasure-valued Skorokhod mapshortest-job-firstshortest-remaining-processing time

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)

Related Items (9)

Law of large numbers for the many-server earliest-deadline-first queue ⋮ Instability of SRPT, SERPT and SJF multiclass queueing networks ⋮ Fluid limits for shortest job first with aging ⋮ Fluid limits for earliest-deadline-first networks ⋮ Stability of linear EDF networks with resource sharing ⋮ Asymptotic Optimality of Power-of-d Load Balancing in Large-Scale Systems ⋮ Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions ⋮ Local edge minimality of SRPT networks with shared resources ⋮ Minimal and Locally Edge Minimal Fluid Models for Resource-Sharing Networks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Invariance of fluid limits for the shortest remaining processing time and shortest job first policies
• On queues with impatience: stability, and the optimality of earliest deadline first
• Waiting time distributions in the accumulating priority queue
• 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
• Reflected diffusions defined via the extended Skorokhod map
• Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling
• On the Skorokhod topology
• The fluid limit of a heavily loaded processor sharing queue
• Real-time queues in heavy traffic with earliest-deadline-first queue discipline
• Diffusion approximation for a processor sharing queue in heavy traffic.
• SPDE limits of many-server queues
• An explicit formula for the Skorokhod map on \([0,a\)]
• Regulating functions on partially ordered sets
• Fluid Limits for Shortest Remaining Processing Time Queues
• Law of Large Number Limits of Limited Processor-Sharing Queues
• 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
• Diffusion limits for shortest remaining processing time queues
• Fluid Limits for Many-Server Systems with Reneging Under a Priority Policy
• Robust Statistics
• Stability of earliest-due-date, first-served queueing networks

This page was built for publication: A Skorokhod map on measure-valued paths with applications to priority queues