Applications of matching and edge‐coloring algorithms to routing in clos networks

DOI10.1002/NET.3230240603MaRDI QIDQ4313624zbMATH OpenOpenAlexFDO

Authors John D. Carpinelli, A. Yavuz Oruç

Publication date 27 November 1994

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230240603

zbMATH Keywords

matchingbipartite graphsedge- coloringrearrangeable Clos networkstelephone switching

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 3982886
• Multirate Rearrangeable Clos Networks and a Generalized Edge-Coloring Problem on Bipartite Graphs
• scientific article; zbMATH DE number 2079420
• scientific article; zbMATH DE number 1769311
• Improved Bounds on Nonblocking 3-Stage Clos Networks

Cites work

• scientific article; zbMATH DE number 3225079 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• A fast parallel algorithm for routing in permutation networks
• On a Class of Rearrangeable Switching Networks Part I: Control Algorithm

Cited in

(5)

• Improved edge-coloring with three colors
• Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks
• A new routing algorithm for multirate rearrangeable Clos networks.
• The number of rearrangements for Clos networks -- new results
• scientific article; zbMATH DE number 3982886 (Why is no real title available?)

This page was built for publication: Applications of matching and edge‐coloring algorithms to routing in clos networks

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