Copyright © 2006 Elsevier Ltd All rights reserved.
On rearrangeable multirate three-stage Clos networks
Received 20 June 2006;
revised 30 November 2006;
accepted 7 December 2006.
Communicated by D.-Z. Du.
Available online 17 December 2006.
References and further reading may be available for this article. To view references and further reading you must purchase this article.
Abstract
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 .
Keywords: Three-stage Clos network; Multirate network; Rearrangeable







E-mail Article
Add to my Quick Links

Cited By in Scopus (0)

(
is a sufficient number of middle-stage switches for the symmetric three-stage Clos network 





