Asymptotically Optimal Loss Network Control

Abstract
We consider a loss network which employs alternative routing and derive the asymptotically optimal call acceptance and routing policy, the limit being as the number of links becomes large. We 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 we consider but is applicable more generally. The results are obtained by combining weak convergence with linear programming techniques.

This publication has 0 references indexed in Scilit: