Analysis of Simple Algorithms for Dynamic Load Balancing

Murat Alanyali · Bruce Hajek

34 citations0/0 files storedMathematics of Operations Research

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Distributed and Parallel Computing Systems Optimization and Search Problems

Abstract

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.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 34 citations exist upstream.

References

1989Resource Allocation Problems: Algorithmic Approaches 1993Asymptotically Optimal Loss Network Control

Cited by

2002Optimal control of queueing networks: an approach via fluid models 2004Insensitive load balancing 1998On large deviations in load sharing networks

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

Imported from OpenAlex (CC0) — nothing here is generated.