Sharp estimates and a central limit theorem for the invariant law for a large star-shaped loss network

Calls arrive in a Poisson stream on a symmetric network constituted of N links of capacity C. Each call requires one channel on each of L distinct links chosen uniformly at random; if none of these links is full, the call is accepted and holds one channel per link for an exponential duration, else it is lost. The invariant law for the route occupation process has a semi-explicit expression similar to that for a Gibbs measure: it involves a combinatorial normalizing factor, the partition function, which is very difficult to evaluate. We study the large N limit while keeping the arrival rate per link fixed. We use the Laplace asymptotic method. We obtain the sharp asymptotics of the partition function, then the central limit theorem for the empirical measure of the occupancies of the links under the invariant law. We also obtain a sharp version for the large deviation principle proved in Graham and OʹConnell (Ann. Appl. Probab. 10 (2000) 104).