Article

O (log over(m, -) . log N) routing algorithm for (2 log N - 1)-stage switching networks and beyond

Chakrabarty, Amitabha; Collier, Martin J. (© 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 ...
Cost efficient implementation of multistage symmetric repackable networks

Chakrabarty, Dr. Amitabha; Collier, Dr. Martin (© 2011 IGI Global, 2011-12)

Symmetric rearrangeable networks (SRN) (Chakrabarty, Collier, & Mukhopadhyay, 2009) make efficient use of hardware, but they have the disadvantage of momentarily disrupting the existing communications during reconfiguration. ...