Heavy Traffic Limits for Join-the-Shortest-Estimated-Queue Policy Using Delayed Information
From MaRDI portal
Publication:4991676
DOI10.1287/MOOR.2020.1056zbMath1470.60244OpenAlexW3035005890MaRDI QIDQ4991676
Publication date: 3 June 2021
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2020.1056
oscillationsdelaysload balancingstate-space collapseheavy traffic limitsjoin the shortest estimated queue
Queueing theory (aspects of probability theory) (60K25) Queues and service in operations research (90B22) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (3)
k-Nearest Neighbor Queues with Delayed Information ⋮ Queues with Updating Information: Finding the Amplitude of Oscillations ⋮ Multidelay Differential Equations: A Taylor Expansion Approach
Cites Work
- On existence and uniqueness of stationary distributions for stochastic delay differential equations with positivity constraints
- Numerical methods for controlled stochastic delay systems
- Steady-State Analysis of the Join-the-Shortest-Queue Model in the Halfin–Whitt Regime
- A Stochastic Analysis of Queues with Customer Choice and Delayed Information
- Existence, Uniqueness, and Stability of Slowly Oscillating Periodic Solutions for Delay Differential Equations with Nonnegativity Constraints
- Open Problem—Load Balancing Using Delayed Information
- Join the Shortest Queue with Many Servers. The Heavy-Traffic Asymptotics
- Queues with Choice via Delay Differential Equations
- Brownian Models of Performance and Control
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Heavy Traffic Limits for Join-the-Shortest-Estimated-Queue Policy Using Delayed Information
