Chung and Ross [SIAM J. Comput., 20 (1991), pp. 726--736] conjectured that the multirate three-stage Clos network C(n,2n-1,r) is rearrangeable in the general discrete bandwidth case; i.e., each connection has a weight chosen from a given finite set {p1, p2,. . .,pk} where $1 \geq p_1 > p_2 > \cdots > p_k > 0$ and pi is an integer multiple of pi, denoted by $p_k \mid p_i$, for $1 \leq i \leq k-1$. In this paper, we prove that multirate three-stage Clos network C(n,2n-1,r) is rearrangeable when each connection has a weight chosen from a given finite set {p1, p2,. . .,pk} where $1 \geq p_1 > p_2 > \cdots > p_{h} > 1/2 \geq p_{h+1} > \cdots > p_k > 0$ and ph+2 | ph+1,ph+3 |ph+2,. . . ,pk | ph+1. We also prove that C(n,2n-1,r) is two-rate rearrangeable and $C(n, \lceil \frac{7n}{3} \rceil, r)$ is three-rate rearrangeable.
[1]
A. Mullin,et al.
Mathematical Theory of Connecting Networks and Telephone Traffic.
,
1966
.
[2]
Jonathan S. Turner,et al.
Nonblocking Multirate Networks
,
1989,
SIAM J. Comput..
[3]
Ding-Zhu Du,et al.
On Multirate Rearrangeable Clos Networks
,
1999,
SIAM J. Comput..
[4]
Keith W. Ross,et al.
On Nonblocking Multirate Interconnection Networks
,
1991,
SIAM J. Comput..