© The Institution of Electrical Engineers
A new routing algorithm for controlling nonblocking Clos-type permutation networks is presented. Unlike previous algorithms based on matrix decomposition and looping techniques, the algorithm uses a new method called scheduling, does not use iterations, and has execution time 0(Nr1/2) where N is the total number of ports, and r is the number of first-stage switches.
References
-
-
1)
-
H.R. Ramanujam
.
Decomposition of permutation networks.
IEEE Trans.
,
639 -
643
-
2)
-
C. Clos
.
A study of nonblocking switching networks.
BSTJ
,
406 -
424
-
3)
-
Gordon, J., Srikanthan, S.: `A unified theory of several switching networks', 8922373.9, , UK patent.
-
4)
-
M. Kubale
.
Comments on the decomposition of permutation networks.
IEEE Trans.
-
5)
-
N.T. Tsao-Wu ,
D.C. Opferman
.
On permutation algorithms for rearrangeable switching networks.
BSTJ
,
1579 -
1618
-
6)
-
V.E. Benes
.
Optimal rearrangeable multistage connecting networks.
BSTJ
,
1641 -
1656
-
7)
-
V.I. Neiman
.
Structure et command optimale de reseaux de connexion sans blocage.
Ann. Telecommun.
,
232 -
238
-
8)
-
N.T. Tsao-Wu
.
On Neiman's algorithm for the control of rearrangeable switching networks.
IEEE Tran.
,
737 -
742
-
9)
-
A. Jajszczyk
.
A simple algorithm for the control of rearrangeable switching networks.
IEEE Trans.
,
169 -
171
http://iet.metastore.ingenta.com/content/journals/10.1049/el_19901138
Related content
content/journals/10.1049/el_19901138
pub_keyword,iet_inspecKeyword,pub_concept
6
6