Nonblocking multirate networks
SIAM Journal on Computing
On nonblocking multirate interconnection networks
SIAM Journal on Computing
Wide-sense nonblocking for multirate 3-stage Clos networks
Theoretical Computer Science
On 1-rate wide-sense nonblocking for 3-stage Clos networks
Discrete Applied Mathematics
On Multirate Rearrangeable Clos Networks
SIAM Journal on Computing
On Rearrangeability of Multirate Clos Networks
SIAM Journal on Computing
Lower bounds for wide-sense nonblocking Clos network
Theoretical Computer Science
Monotone routing in multirate rearrangeable clos networks
Journal of Parallel and Distributed Computing
On rearrangeable multirate three-stage Clos networks
Theoretical Computer Science
Analyzing nonblocking switching networks using linear programming (duality)
INFOCOM'10 Proceedings of the 29th conference on Information communications
Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
Journal of Combinatorial Optimization
| Hi-index | 5.23 |
In this paper, we study the problem of finding routing algorithms on the multirate rearrangeable Clos networks which use as few number of middle-stage switches as possible. We propose a new routing algorithm called the "grouping algorithm". This is a simple algorithm which uses fewer middle-stage switches than all known strategies, given that the number of input-stage switches and output-stage switches are relatively small compared to the size of input and output switches. In particular, the grouping algorithm implies that m = 2n + [(n - 1)/2k] is a sufficient number of middle-stage switches for the symmetric three-stage Clos network C(n, m, r) to be multirate rearrangeable, where k is any positive integer and r ≤ n/(2k - 1).