Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks
2009 (English)In: Journal of Mathematical Modelling and Algorithms, ISSN 1570-1166, Vol. 8, no 1, 81-100 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
2009. Vol. 8, no 1, 81-100 p.
Clos networks; Edge coloring; Matching; Optimization; Switches
IdentifiersURN: urn:nbn:se:liu:diva-18834DOI: 10.1007/s10852-008-9090-0OAI: oai:DiVA.org:liu-18834DiVA: diva2:221881
The original publication is available at www.springerlink.com:
Kaj Holmberg, Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks, 2009, Journal of Mathematical Modelling and Algorithms, (8), 1, 81-100.
Copyright: Springer Science Business Media