On Rearrangeability of Multirate Clos Networks

DOI10.1137/S0097539796313921MaRDI QIDQ4268705zbMATH OpenFDO

Authors Guohui Lin, Du Ding-Zhu, Xiaodong Hu, Guoliang Xue

Publication date 28 October 1999

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539796313921

zbMATH Keywords

minimization of the number of center switchesmultirate Clos networksrearrangeability

Mathematics Subject Classification ID

Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Communication networks in operations research (90B18)

Recommendations

• On Multirate Rearrangeable Clos Networks
• On rearrangeable multirate three-stage Clos networks
• scientific article; zbMATH DE number 1535251
• A new routing algorithm for multirate rearrangeable Clos networks.
• Monotone routing in multirate rearrangeable Clos networks
• On 1-rate and 2-rate multicast 3-stage Clos networks
• scientific article; zbMATH DE number 2079420
• Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs
• A New Approach for Rearrangeable Multicast Switching Networks
• On Multicast Rearrangeable 3-stage Clos Networks Without First-Stage Fan-Out

Cited in

(17)

• A new routing algorithm for multirate rearrangeable Clos networks.
• Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
• The number of rearrangements for Clos networks -- new results
• On Multicast Rearrangeable 3-stage Clos Networks Without First-Stage Fan-Out
• Edge Coloring and Decompositions of Weighted Graphs
• scientific article; zbMATH DE number 3503131 (Why is no real title available?)
• On Multirate Rearrangeable Clos Networks
• scientific article; zbMATH DE number 1222834 (Why is no real title available?)
• Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs
• scientific article; zbMATH DE number 2079420 (Why is no real title available?)
• scientific article; zbMATH DE number 2080547 (Why is no real title available?)
• scientific article; zbMATH DE number 1535251 (Why is no real title available?)
• Asymmetrical multiconnection three‐stage clos networks
• Monotone routing in multirate rearrangeable Clos networks
• More on online weighted edge coloring
• Crosstalk-free rearrangeable multistage interconnection networks
• On rearrangeable multirate three-stage Clos networks

This page was built for publication: On Rearrangeability of Multirate Clos Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268705)