Analysis of some simple policies for dynamic resource allocation

Complexity-performance trade-offs are investigated for dynamic resource allocation in load sharing networks with Erlang-type statistics. The emphasis is on the performance of simple allocation strategies that can be implemented on-line. The resource allocation problem is formulated as a stochastic optimal control problem. Variants of a simple least load routing policy are shown to lead to a fluid type limit and to be asymptotically optimal. Either finite capacity constraints or migration of load can be incorporated into the setup.

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Electrical Engineering

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Alanyali, Murat

Contributors dc:contributor

• Hajek, Bruce

• Engineering, Industrial
• Operations Research

Statement dc:rights

• Copyright 1996 Alanyali, Murat

Language dc:language

eng

Identifier

9780591197273
AAI9712186
(UMI)AAI9712186

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/19263