The Effect of Choosing the Switches for Rearrangements in Switching Networks
Andrzej Jajszczyk, J. Rajski · IRE Transactions on Communications Systems · 1980
Known rearrangement algorithms proposed by Slepian and Paull (method 1) involve two middle switches of the three-stage Clos network. These switches are chosen arbitrarily. However, the middle switches selection rules affect the rearrangement process. In this paper four methods for choosing the switches were studied. Simulation results and analysis have shown that the allocation of the least used switches can decrease the volume of computation required for rearrangements. In the case of limited rearrangement, this method improves the blocking performance of a network.