Three-Stage Rearrangeable Connecting Networks in the Thermodynamic Limit: Number of Needed Reswitchings

We show that for sufficiently large systems the needed number of reswitchings is independent of the size and we derive formulas giving the relation between the probability that we have to rearrange and the average number of needed reswitchings. These formulas are backed by computer simulations. Moreover, the packing hunting strategy leads to a greater average number of reswitchings when a call is blocked but, of course, to a lesser number of blocking states, and after all, is the best.