Browsing Conference Paper by Subject "Rearrangeable networks"
Now showing items 1-1 of 1
-
Low complexity routing algorithm for rearrangeable switching networks
(© 2013 IEEE, 2013-03)For a long time among the research community. Routing algorithms for this class of networks have attracted lots of researchers along with other related areas, such as modification of the networks structure, crosspoints ...