Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions
DOI10.1214/21-AAP1741zbMath1499.60316arXiv2003.03655OpenAlexW3009595375MaRDI QIDQ2083259
Amber L. Puha, Sayan Banerjee, Amarjit Budhiraja
Publication date: 10 October 2022
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2003.03655
queueingfunctional central limit theoremregular variationrandom fieldheavy trafficheavy tailsmeasure valued processesstate space collapseshortest remaining processing timesynchronization phenomenonderivative of the Skorohod mapintertwined SRPT queues
Random fields (60G60) Queueing theory (aspects of probability theory) (60K25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Random measures (60G57) Functional limit theorems; invariance principles (60F17)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sensitivity analysis for diffusion processes constrained to an orthant
- Diffusion limits for shortest remaining processing time queues under nonstandard spatial scaling
- A Skorokhod map on measure-valued paths with applications to priority queues
- Heavy traffic limits for some queueing networks
- Diffusion limits for SRPT and LRPT queues via EDF approximations
- Stochastic-Process Limits
- Fluid Limits for Shortest Remaining Processing Time Queues
- Directional Derivatives of Oblique Reflection Maps
- Fluid Limits for Multiple-Input Shortest Remaining Processing Time Queues
- The steady-state appearance of the M/G/1 queue under the discipline of shortest remaining processing time
- Power-Law Distributions in Empirical Data
- A criterion of convergence of measure‐valued processes: application to measure branching processes
- Technical Note—A New Proof of the Optimality of the Shortest Remaining Processing Time Discipline
- Probability
- Diffusion limits for shortest remaining processing time queues
- Weak convergence theorems for priority queues: preemptive-resume discipline
- Multiple channel queues in heavy traffic. I
- Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline
This page was built for publication: Heavy traffic scaling limits for shortest remaining processing time queues with heavy tailed processing time distributions