Asymptotically optimal loss network control

The authors consider a loss network which employs alternative routing and derive the asymptotically optimal call acceptance and routine policy, the limit being as the number of links becomes large. They show that a well known control policy, least busy alternative routing with trunk reservation, is asymptotically optimal. The approach of the paper is not specific to the loss network control problem that the authors consider but is applicable more generally. The results are obtained by combining weak convergence with linear programming techniques.