Grzegorz DanilewiczWojciech KabacińskiMarek MichalskiMariusz Żal
A new control algorithm for log 2 ( N , 0, p ) switching networks composed of 2 × 2 switching elements has been proposed. Under this algorithm, log 2 ( N , 0, p ) switching networks with even number of stages are wide-sense nonblocking (WSNB) if p is the same as for the rearrangeable nonblocking (RNB) one. In this paper we extend this solution to log d ( N , 0, p ) switching networks. The control algorithm is appropriately modified to switching networks composed of d × d switches. Wide-sense nonblocking operation of such switching networks with even number of stages is proved. We showed that number of planes needed for WSNB operation is also the same as in RNB switching networks.
Wojciech KabacińskiMarek Michalski
Grzegorz DanilewiczWojciech KabacińskiMarek MichalskiMariusz Żal
K.S. ChanSammy ChanKwan L. Yeung
Paul FeldmanJoel FriedmanNicholas Pippenger