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

DOI10.1002/net.3230240603zbMath0822.90058OpenAlexW2027472000MaRDI QIDQ4313624

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)

Related Items (4)

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

Cites Work

• A fast parallel algorithm for routing in permutation networks
• On a Class of Rearrangeable Switching Networks Part I: Control Algorithm
• Unnamed Item
• Unnamed Item

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