We consider a .reduced state space' approach to the analysis of blocking in stochastic loss networks. We show how this approach provides insight into the approximations currently used in large networks and enables improved approximations to be deduced. We further give some .heavy traffic' asymptotic results for the limiting scheme of Kelly (1986).