Analysis of Simple Algorithms for Dynamic Load Balancing

Published Online:https://doi.org/10.1287/moor.22.4.840

The principle of load balancing is examined for dynamic resource allocation subject to certain constraints. The emphasis is on the performance of simple allocation strategies which can be implemented on-line. Either finite capacity constraints on resources or migration of load can be incorporated into the setup. The load balancing problem is formulated as a stochastic optimal control problem. Variants of a “Least Load Routing” policy are shown to lead to a fluid type limit and to be asymptotically optimal.

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.