The problem of call admission control and routing in a multi-service circuit-switched loss network can be solved optimally under certain assumptions by the tools of Markov decision theory. However in networks of practical size a number of simplifying approximations are needed to make the solution feasible. Assuming link independence, we propose a new method for approximating the state-dependent...