The Routing Algorithm and Wide-Sense Nonblocking Conditions for Multiplane Baseline Switching Networks

A new control algorithm for the multiplane baseline switching network is proposed in this paper. This algorithm chooses a plane for a new connection in such a way that this new connection blocks the lowest number of possible future connections in the plane. We have proved, that when using this algorithm connections can be routed without blocking when the number of planes in the switching network is the same as in the rearrangeable one for even number of stages. When the switching network contains the odd number of stages, required number of planes is greater than in the rearrangeable switching network but less than in the strict-sense nonblocking one. Different implementations of the proposed algorithm are also considered. It should be noted, that the algorithm can determine the plane for a new connection in O(N
^0.5
) time or even in O(1) time depending on the implementation. The overall time complexity of the proposed algorithm is from O(N
^3.5
log
₂
N) to O(N log
₂
N) depending on its implementation and number of processors used