標題: On multirate rearrangeable Clos networks
作者: Du, DZ
Gao, B
Hwang, FK
Kim, JH
應用數學系
Department of Applied Mathematics
關鍵字: multirate switching;rearrangeable;Clos network
公開日期: 4-Aug-1998
摘要: 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.
URI: http://hdl.handle.net/11536/32456
ISSN: 0097-5397
期刊: SIAM JOURNAL ON COMPUTING
Volume: 28
Issue: 2
起始頁: 464
結束頁: 471
Appears in Collections:Articles