Now showing items 1-1 of 1
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 ...