Control Algorithms for the Rearrangeable Switching Network

The rearrangeable switching network can realize the arbitrary permutation and has least number of stages to compare with other multistage interconnection networks.In this paper,some kinds of the control algorithms for this network are described and analyzed,and their advantages and disadvantages are discussed from the point of view of permutation properties and time complexity.