Skip to Main Content
Control algorithms for the multiplane baseline switching network are considered in this paper. The first algorithm do not take into account the crosstalk in switching element, while the second algorithm allows to omit the first order crosstalk. In both cases we have derived wide-sense non-blocking conditions. It is also shown that these algorithms require the smallest number of plane, i.e. there is no other algorithms which will lead to the lower number of needed planes. It should be noted, that the algorithm can determine a plane for a new connection in O(N0.5) time or even in O(1) time depending on the implementation.