On large deviations in load sharing networks

Abstract

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.