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

In this paper the new control algorithm for log2(N, 1, p) switching fabrics is proposed. This algorithm is the extension of the algorithm we propose for log2(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.

[1]  Yeonghwan Tscha,et al.  Yet another result on multi-log2N networks , 1999, IEEE Trans. Commun..

[2]  A. Mullin,et al.  Mathematical Theory of Connecting Networks and Telephone Traffic. , 1966 .

[3]  A. Milewski,et al.  The Effect of Call Routing Rules in Non-Blocking Three-Stage Switching Networks , 1979, IEEE Trans. Commun..

[4]  Chin-Tau A. Lea,et al.  Multi-log2N networks and their applications in high-speed electronic and photonic switching systems , 1990, IEEE Trans. Commun..

[5]  Frank Hwang,et al.  The Mathematical Theory of Nonblocking Switching Networks , 1998 .

[6]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[7]  Yuanyuan Yang,et al.  Nonblocking Broadcast Switching Networks , 1991, IEEE Trans. Computers.

[8]  Chin-Tau A. Lea.  Bipartite graph design principle for photonic switching systems , 1990, IEEE Trans. Commun..

[9]  Jonathan S. Turner,et al.  Multirate Clos networks , 2003, IEEE Commun. Mag..

[10]  Achille Pattavina,et al.  Switching theory : architectures and performance in broadband ATM networks , 1998 .

[11]  Wojciech Kabacinski.  Nonblocking Electronic and Photonic Switching Fabrics , 2005 .

[12]  Wojciech Kabacinski,et al.  The Routing Algorithm and Wide-Sense Nonblocking Conditions for Multiplane Baseline Switching Networks , 2006, IEEE Journal on Selected Areas in Communications.

[13]  Andrzej Jajszczyk.  Nonblocking, repackable, and rearrangeable Clos networks: fifty years of the theory evolution , 2003, IEEE Commun. Mag..

[14]  Frank K. Hwang.  A survey of nonblocking multicast three-stage Clos networks , 2003, IEEE Commun. Mag..

[15]  Tarek S. El-Bawab,et al.  Optical Switching , 2006 .

[16]  Chin-Tau Lea,et al.  Logd(N,m,p) rearrangeable nonblocking networks , 1994 .

[17]  Chin-Tau A. Lea,et al.  Log2 (N, m, p) strictly nonblocking networks , 1991, IEEE Trans. Commun..