Now showing items 1-2 of 2
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 ...
O (log over(m, -) . log N) routing algorithm for (2 log N - 1)-stage switching networks and beyond
(© 2014 Elsevier Inc., 2014)
This paper addresses routing algorithm for a classic network called rearrangeable network with a complexity which is minimum than any other reported algorithms in this class. A new routing algorithm is presented for symmetric ...