The Control Algorithm and WSNB Operation of Log2(N,1,p) Switching Fabrics

In this paper the new control algorithm for log₂(N, 1, p) switching fabrics is proposed. This algorithm is the extension of the algorithm we propose for log₂(N, 1, p) switching fabrics. The idea of the algorithm is to choose such a plane for the new connection in which this new connection will block the fewest number of possible future connections. Wide-sense nonblocking conditions are derived and proved when this algorithm is used for connection set up in such kind of switching fabrics with odd or even number of stages. The number of planes needed is the same as for the rearrangeable switching fabrics when the number of stages is even, and greater than for the rearrangeable switching fabric but lower than for the strict-sense nonblocking fabric, when the number of stages is odd.