On simple algorithms for dynamic load balancing

M. Alanyali, B. Hajek

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

The paper focuses on the dynamic resource allocation problem. In communication networks such as wireless or circuit switching networks, resources correspond to base stations or links, and the load corresponds to the calls in the network. The principle of load balancing is examined for dynamic resource allocation. The question of interest is the performance of simple allocation strategies which can be implemented online. Either finite capacity constraints on resources or mobility of users can be incorporated into the setup. The load balancing problem is formulated as an optimal control problem, and variants of a simple "least loaded routing" policy are shown to be asymptotically optimal for large call arrival rates

Original languageEnglish (US)
Title of host publicationINFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages230-238
Number of pages9
ISBN (Print)081866990X, 9780818669903
DOIs
StatePublished - 1995
EventINFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies - Boston, MA, United States
Duration: Apr 2 1995Apr 6 1995

Publication series

NameProceedings - IEEE INFOCOM
Volume1
ISSN (Print)0743-166X

Other

OtherINFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies
Country/TerritoryUnited States
CityBoston, MA
Period4/2/954/6/95

ASJC Scopus subject areas

  • General Computer Science
  • Electrical and Electronic Engineering

Fingerprint

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

Cite this