A Simple Algorithm for the Control of Rearrangeable Switching Networks

A simple algorithm for the control of rearrangeable switching networks
\nu(n, n, r)
is given. This algorithm makes it possible to compute the switch settings that implement a given Permutation. The algorithm takes serial time
O(nr^{2})
and consists of one phase, i.e., it does not require iterations. The version of the algorithm which can be used for group switching is also presented.