A new approach for rerouting of rearrangeable MIN
Mohammad Reza Salehnamadi, Mehdi N. Fesharaki · 2003
A new method to reroute a rearrangeable three-stage Clos network is presented. A network controller implements a new method in the first stage while self-routing is used in the remaining columns. The new method limits the rearrangement process to the box in which one of its inputs requires a new path to the output. This method has the following advantages: (1) the rerouting times is low; (2) the routings of other boxes are not suspended or interrupted; (3) the controller is very simple because it is limited to only one box; (4) because of the few inputs/outputs to the controller box, a large variety of switching algorithms can be applied in the box. A proper mathematical analysis for the idea is presented and then the nonblocking condition and rearrangeability are analyzed and the hardware complexity bound is determined. The time complexity depends on the routing algorithm, and, with a simple serial method, is O(/spl radic/N) where N is the number of inputs.