Loading...
research article
Three-Stage rearrangeable connecting networks in the thermodynamic limit: number of needed reswitchings
Lutton, J.
•
Bonomi, E.
•
Feix, M.
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.
Type
research article
Authors
Lutton, J.
•
Bonomi, E.
•
Feix, M.
Publication date
1983
Published in
Volume
COM-31
Issue
1
Start page
110
End page
114
Note
PRO 83.04
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
February 13, 2006
Use this identifier to reference this record