Analysis of simple algorithms for dynamic load balancing

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.