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 reswitching when a call is blocked but, of course, to a lesser number of blocking states , and, after all, is the best.


Published in:
IEEE Transactions on Communications, COM-31, 1, 110-114
Year:
1983
Note:
PRO 83.04
Laboratories:




 Record created 2006-02-13, last modified 2018-01-27


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)