Exact analysis for a class of simple, circuit-switched networks with blocking

We consider the same circuit switching problem as in Mitra [1]. The calculation of the blocking probabilities is reduced to finding the partition function for a closed exponential pseudo-network with L.1 customers. This pseudo-network differs from that in [1] in one respect only: service rates at nodes 1, 2, ., p depend on the queue length. The asymptotic expansion developed in [1] follows from our exact expression for the partition function.