Analytical and simulation study of simple rearrangeable multiexchange networks

Congestion probabilities for calls in simple three-exchange networks operated with and without rearrangements are determined analytically and by digital simulation. Load-loss curves are obtained, from which the gain in traffic capacity due to rearrangement and degradation due to overload can be found. It is concluded that routing control with rearrangements possesses a potential traffic-handling advantage over conventional automatic alternative routing.