On rearrangeable multirate three-stage Clos networks

Since 1989 when Melen and Turner introduced an elegant model for interconnection networks that carry multirate traffic, the theory and applications of the three-stage Clos network has been extended from circuit switching to the multirate environment. Chung and Ross conjectured that C(n,2n−1,r) is rearrangeable if each call has weight chosen from a given set of k weights. Lin et al. confirmed the conjecture for a restricted discrete bandwidth case only. In this paper we show that the conjecture of Chung and Ross holds not only in the discrete bandwidth case but also in the continuous bandwidth case for .