Accuracy of state space collapse for earliest-deadline-first queues
From MaRDI portal
Publication:997940
DOI10.1214/105051605000000809zbMath1129.60084arXivmath/0607056OpenAlexW1985042389MaRDI QIDQ997940
Łukasz Kruk, John P. Lehoczky, Steven E. Shreve
Publication date: 8 August 2007
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0607056
Queueing theory (aspects of probability theory) (60K25) Brownian motion (60J65) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Random measures (60G57)
Related Items
Personalized queues: the customer view, via a fluid model of serving least-patient first ⋮ Fluid Limits for Multiple-Input Shortest Remaining Processing Time Queues ⋮ Stability of linear EDF networks with resource sharing ⋮ An explicit formula for the Skorokhod map on \([0,a\)] ⋮ Heavy traffic limit for a processor sharing queue with soft deadlines ⋮ Heavy traffic analysis for EDF queues with reneging
Cites Work
- Multiple-input heavy-traffic real-time queues.
- Real-time queues in heavy traffic with earliest-deadline-first queue discipline
- Earliest-deadline-first service in heavy-traffic acyclic networks.
- Stochastic-Process Limits
- Multiple channel queues in heavy traffic. I
- The Equivalence of Functional Central Limit Theorems for Counting Processes and Associated Partial Sums
- Convergence Criteria for Multiparameter Stochastic Processes and Some Applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item