Abstract
We consider routing in symmetrical three stage Clos networks. Especially we search for the routing of an additional connection that requires the least rearrangements, i.e. the minimal number of changes of already routed connections. We describe polynomial methods, based on matchings and edge colorings. The basic idea is to swap colors along alternating paths. The paths need to be maximal, and the shortest of these maximal paths is chosen, since it minimizes the rerouting that needs to be done. Computational tests confirm the efficiency of the approach.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Beneš, V.: Mathematical Theory of Connecting Networks and Telephone Traffic. Academic, London (1965)
Berge, C.: Graphs and Hypergraphs. North-Holland, Amsterdam (1973)
Carpinelli, J.D., Oruç, A.Y.: Applications of matching and edge-coloring algorithms to routing in Clos networks. Networks 24, 319–326 (1994)
Clos, C.: A study of nonblocking switching networks. Bell Syst. Tech. J. 32, 406–424 (1953)
Cole, R., Hopcroft, J.: On edge coloring bipartite graphs. SIAM J. Comput. 11, 540–546 (1982)
Cole, R., Ost, K., Schirra, S.: Edge-coloring bipartite multigraphs in O(E log D) time. Combinatorica 21, 5–12 (2001)
Holmberg, K.: Optimization models for switching networks of Clos type with many stages. AMO – Adv. Model. Optim. 10(1) (2008)
Hwang, F.K.: Control algoritmhs for rearrangeable Clos networks. IEEE Trans. Commun. 31, 952–954 (1983)
Lee, H.Y., Hwang, F.K., Carpinelli, J.D.: A new decomposition algorithm for rearrangeable Clos interconnection networks. IEEE Trans. Commun. 44, 1572–1578 (1996)
Schrijver, A.: Bipartite edge-coloring in O(Δm) time. SIAM J. Comput. 28, 841–846 (1999)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Holmberg, K. Graph Optimization Approaches for Minimal Rerouting in Symmetric Three Stage Clos Networks. J Math Model Algor 8, 81–100 (2009). https://doi.org/10.1007/s10852-008-9090-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10852-008-9090-0