Analysis of simple algorithms for dynamic load balancing

Murat Alanyali, Bruce Hajek

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish (US)
Pages (from-to)840-871
Number of pages32
JournalMathematics of Operations Research
Issue number4
StatePublished - Nov 1997


  • Dynamic resource allocation
  • Fluid equations
  • Least load routing
  • Load balancing
  • Loss networks

ASJC Scopus subject areas

  • Mathematics(all)
  • Computer Science Applications
  • Management Science and Operations Research


Dive into the research topics of 'Analysis of simple algorithms for dynamic load balancing'. Together they form a unique fingerprint.

Cite this