Open problem: Load balancing using delayed information
From MaRDI portal
Recommendations
- Asymptotically optimal open-loop load balancing
- Optimal allocation of servers and processing time in a load balancing system
- scientific article; zbMATH DE number 934840
- Scalable load balancing in networked systems: universality properties and stochastic coupling methods
- A lower bound on the queueing delay in resource constrained load balancing
Cites work
- A simple dynamic routing problem
- An analysis of queues with delayed information and time-varying arrival rates
- scientific article; zbMATH DE number 3868389 (Why is no real title available?)
- Nonlinear dynamics in queueing theory: determining the size of oscillations in queues with delay
- On existence and uniqueness of stationary distributions for stochastic delay differential equations with positivity constraints
- Optimality of the shortest line discipline
- Queueing system with selection of the shortest of two queues: An asymptotic approach
- Queues with choice via delay differential equations
Cited in
(5)- Asymptotically optimal open-loop load balancing
- Zero-wait load balancing with sparse messaging
- Heavy traffic limits for join-the-shortest-estimated-queue policy using delayed information
- Introduction to the Applied Probability Society’s “Open Problems in Applied Probability” Session at the INFORMS Annual Meeting, Phoenix, Arizona, November 4–7, 2018
- Optimal allocation of servers and processing time in a load balancing system
This page was built for publication: Open problem: Load balancing using delayed information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5113907)
