On load balancing in Erlang networks
Murat Alanyali, Bruce Hajek · 1996
Abstract This chapter summarizes our recent work on the dynamic resource allocation problem. The question of interest is the performance of simple allocation strategies which can be implemented on-line. The chapter focuses on the least load routing policy. The analysis is based on fluid limit equations and the theory of large deviations for Markov processes with discontinuous statistics.