Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks

DOI10.1007/S10852-008-9090-0MaRDI QIDQ841605zbMATH OpenOpenAlexFDO

Authors Kaj Holmberg

Publication date 18 September 2009

Published in JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)

Full work available at URL http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-18834

zbMATH Keywords

clos networksedge coloringmatchingoptimizationswitches

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Optimization models for routing in switching networks of Clos type with many stages
• scientific article; zbMATH DE number 1769311
• scientific article; zbMATH DE number 2079420
• Asymmetrical multiconnection three‐stage clos networks
• scientific article; zbMATH DE number 2089196

Cites work

• Applications of matching and edge‐coloring algorithms to routing in clos networks
• Bipartite Edge Coloring in O(\Delta m) Time
• Control Algorithms for Rearrangeable Clos Networks
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• On Edge Coloring Bipartite Graphs
• Optimization models for routing in switching networks of Clos type with many stages

Cited in

(3)

• Optimization models for routing in switching networks of Clos type with many stages
• scientific article; zbMATH DE number 3503132 (Why is no real title available?)
• scientific article; zbMATH DE number 1769311 (Why is no real title available?)

This page was built for publication: Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks

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