Three policies, namely optimal repacking, least load routing, and
Bernoulli splitting, are considered for dynamic resource allocation in load
sharing networks with standard Erlang type statistics. Large deviations
principles are established for the three policies in a simple network of three
consumer types and two resource locations and are used to identify the network
overflow exponents. The overflow exponents for networks with arbitrary
topologies are identified for optimal repacking and Bernoulli splitting
policies and conjectured for the least load routing policy.
Publié le : 1998-02-14
Classification:
Large deviations,
load
balancing,
loss
networks,
allocation,
Erlang
systems,
60K30,
60F10,
68M20,
90B15,
93E,
60J
@article{1027961034,
author = {Alanyali, Murat and Hajek, Bruce},
title = {On large deviations in load sharing networks},
journal = {Ann. Appl. Probab.},
volume = {8},
number = {1},
year = {1998},
pages = { 67-97},
language = {en},
url = {http://dml.mathdoc.fr/item/1027961034}
}
Alanyali, Murat; Hajek, Bruce. On large deviations in load sharing networks. Ann. Appl. Probab., Tome 8 (1998) no. 1, pp. 67-97. http://gdmltest.u-ga.fr/item/1027961034/