We consider a loss network which employs alternative routing and deriv
e the asymptotically optimal call acceptance and routing policy, the l
imit being as the number of links becomes large. We show that a well k
nown control policy, least busy alternative routing with trunk reserva
tion, is asymptotically optimal. The approach of the paper is not spec
ific to the loss network control problem that we consider but is appli
cable more generally. The results are obtained by combining weak conve
rgence with linear programming techniques.