liu.seSearch for publications in DiVA
Change search
ReferencesLink to record
Permanent link

Direct link
Graph Optimization Approaches for Minimal Rerouting in Symmetric Three Stage Clos Networks
Linköping University, The Institute of Technology. Linköping University, Department of Mathematics, Optimization .ORCID iD: 0000-0001-5907-0087
2007 (English)Report (Other academic)
Abstract [en]

Considering routing in symmetrical three stage Clos networks, 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
Linköping: Linköpings universitet , 2007.
LiTH-MAT-R, ISSN 0348-2960 ; 2007:12
National Category
URN: urn:nbn:se:liu:diva-41369ISRN: LiTH-MAT-R-2007-12--SELocal ID: 55733OAI: diva2:262221
Available from: 2009-10-10 Created: 2009-10-10 Last updated: 2013-08-29Bibliographically approved

Open Access in DiVA

No full text

Search in DiVA

By author/editor
Holmberg, Kaj
By organisation
The Institute of TechnologyOptimization

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 306 hits
ReferencesLink to record
Permanent link

Direct link