Multirate rearrangeable clos networks and a generalized edge coloring problem on bipartite graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A new routing algorithm for multirate rearrangeable Clos networks
Theoretical Computer Science
An approximate König's theorem for edge-coloring weighted bipartite graphs
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
On rearrangeable multirate three-stage Clos networks
Theoretical Computer Science
Edge Coloring and Decompositions of Weighted Graphs
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
Journal of Combinatorial Optimization
Distributed adaptive routing for big-data applications running on data center networks
Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems
| Hi-index | 0.00 |
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.