A new routing algorithm for multirate rearrangeable Clos networks
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)/2(k)] 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 less than or equal to n/(2(k) - 1). (C) 2002 Elsevier Science B.V. All rights reserved.
routing algorithms clos networks multirate networks rearrangeable networks