Computing Approximate Blocking Probabilities for Large Loss Networks with State Dependent Routing

We develop a reduced load approximation (also referred to as an Erland fixed point approximation) for estimating end-to-end blocking probabilities in loss networks (e.g., circuit switched networks) with state-dependent routing. The main idea is to approximate the idle capacity distribution for each link in the network, and to assume that these distributions are independent from link to link.