Some Allocation Problems for Critically Loaded Loss Systems with Independent Links.

In this paper we consider the allocation of traffic and/or servers to independent links (stations), where each link is an Erlang loss system (multiple servers and no additional waiting room). These allocation problems are analyzed in the asymptotic regime known as "critical loading", where both the number of servers and the offered traffic are large and almost equal. Using what is essentially a normal approximation to the blocking probability in this regime, the original allocation problems are transformed into their asymptotic forms, which are then solved.