DocumentCode :
769617
Title :
Three-Stage Rearrangeable Connecting Networks in the Thermodynamic Limit: Number of Needed Reswitchings
Author :
Bonomi, Ernest ; Lutton, Jean Luc ; Feix, Marc Roy
Author_Institution :
CNRS, Orleans Codex, France
Volume :
31
Issue :
1
fYear :
1983
fDate :
1/1/1983 12:00:00 AM
Firstpage :
110
Lastpage :
113
Abstract :
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.
Keywords :
Communication switching; Switching, communication; Communication switching; Communications Society; Computer simulation; Data processing; Displays; Entropy; Joining processes; Switches; Thermodynamics; Upper bound;
fLanguage :
English
Journal_Title :
Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
0090-6778
Type :
jour
DOI :
10.1109/TCOM.1983.1095730
Filename :
1095730
Link To Document :
بازگشت