An analytical model on network blocking probability

In this paper, we present a new analytical model on the blocking probability of the three-stage Clos network. Due to the effect of approximations, a common problem with previously proposed analytical models is that they may not be very accurate in some cases. In particular, the blocking probability in these models contradicts the well-known deterministic nonblocking condition for the Clos network. The most notable feature of the newly proposed model is that it can more accurately describe the blocking behavior of the network and is consistent with the deterministic nonblocking condition.