Heavy traffic analysis for EDF queues with reneging
From MaRDI portal
Publication:535200
DOI10.1214/10-AAP681zbMath1220.60053arXiv1104.1047MaRDI QIDQ535200
Kavita Ramanan, Łukasz Kruk, John P. Lehoczky, Steven E. Shreve
Publication date: 11 May 2011
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.1047
60K25: Queueing theory (aspects of probability theory)
90B22: Queues and service in operations research
60J65: Brownian motion
68M20: Performance evaluation, queueing, and scheduling in the context of computer systems
60G57: Random measures
Related Items
Minimality of EDF networks with resource sharing, Diffusion approximations for open Jackson networks with reneging, On queues with impatience: stability, and the optimality of earliest deadline first, 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, Developing a performance index with a Poisson process and an exponential distribution for operations management and continuous improvement, Edge minimality of EDF resource sharing networks, Impact of priority sequencing decisions on on-time probability and expected tardiness of orders in make-to-order production systems with external due-dates, Stability of linear EDF networks with resource sharing, Ergodicity of an SPDE associated with a many-server queue, A Skorokhod map on measure-valued paths with applications to priority queues, Fuzzy testing of operating performance index based on confidence intervals, Fluid limits for shortest job first with aging, Replicate to the shortest queues, SDEs with two reflecting barriers driven by semimartingales and processes with bounded \(p\)-variation, Fluid limits for earliest-deadline-first networks, Asymptotic Optimality of Power-of-d Load Balancing in Large-Scale Systems, Fluid Limits of G/G/1+G Queues Under the Nonpreemptive Earliest-Deadline-First Discipline
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Law of large numbers limits for many-server queues
- Accuracy of state space collapse for earliest-deadline-first queues
- Steady state approximations of limited processor sharing queues in heavy traffic
- Reflected Brownian motion on an orthant
- Stochastic discrete flow networks: Diffusion approximations and bottlenecks
- A diffusion approximation for a Markovian queue with reneging
- Fluid and heavy traffic diffusion limits for a generalized processor sharing model
- Real-time queues in heavy traffic with earliest-deadline-first queue discipline
- Diffusion approximation for a processor sharing queue in heavy traffic.
- Earliest-deadline-first service in heavy-traffic acyclic networks.
- Convex duality and the Skorokhod problem. II
- On the behavior of LIFO preemptive resume queues in heavy traffic
- An explicit formula for the Skorokhod map on \([0,a\)]
- Heavy traffic limit for a processor sharing queue with soft deadlines
- Validity of heavy traffic steady-state approximations in generalized Jackson networks
- A diffusion approximation for a GI/GI/1 queue with balking or reneging
- Stochastic-Process Limits
- A Multiserver Queueing System with Impatient Customers
- Fluid Limits for Shortest Remaining Processing Time Queues
- Double Skorokhod Map and Reneging Real-Time Queues
- Applied Probability and Queues
- Diffusion limits for shortest remaining processing time queues
- Weak convergence theorems for priority queues: preemptive-resume discipline
- Multiple channel queues in heavy traffic. I
