Open Access
Translator Disclaimer
February 1998 On large deviations in load sharing networks
Murat Alanyali, Bruce Hajek
Ann. Appl. Probab. 8(1): 67-97 (February 1998). DOI: 10.1214/aoap/1027961034


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.


Download Citation

Murat Alanyali. Bruce Hajek. "On large deviations in load sharing networks." Ann. Appl. Probab. 8 (1) 67 - 97, February 1998.


Published: February 1998
First available in Project Euclid: 29 July 2002

zbMATH: 0938.60097
MathSciNet: MR1620334
Digital Object Identifier: 10.1214/aoap/1027961034

Primary: 60K30
Secondary: 60F10 , 60J , 68M20 , 90B15 , 93E

Keywords: Allocation , Erlang systems , large deviations , load balancing , Loss networks

Rights: Copyright © 1998 Institute of Mathematical Statistics


Vol.8 • No. 1 • February 1998
Back to Top