In the multirate switching environment each (connection) request is associated with a bandwidth weight. We consider a three-stage Clos network and assume that each link has a capacity of one (after normalization). The network is rearrangeable if for all possible sets of requests such that each input and output link generates a total weight not exceeding one, there always exists a set of paths, one for each request, such that the sum of weights of all paths going through a link does not exceed the link capacity. The question is to determine the minimum number of center switches which guarantees rearrangeability. We obtain a lower bound of 11n/9 and an upper bound of 41n/16. We then extend the result for the three-stage Clos network to the multistage Clos network. Finally, we propose the weighted version of the edge-coloring problem, which somehow has escaped the literature, associated with our switching network problem.
[1]
A. Mullin,et al.
Mathematical Theory of Connecting Networks and Telephone Traffic.
,
1966
.
[2]
D. König.
Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre
,
1916
.
[3]
Jonathan S. Turner,et al.
Nonblocking Multirate Networks
,
1989,
SIAM J. Comput..
[4]
L. Lovász.
Combinatorial problems and exercises
,
1979
.
[5]
Keith W. Ross,et al.
On Nonblocking Multirate Interconnection Networks
,
1991,
SIAM J. Comput..