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

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Graph optimization approaches for minimal rerouting in symmetric three stage Clos networks
Linköping University, Department of Mathematics, Optimization . Linköping University, The Institute of Technology.ORCID iD: 0000-0001-5907-0087
2009 (English)In: Journal of Mathematical Modelling and Algorithms, ISSN 1570-1166, Vol. 8, no 1, 81-100 p.Article in journal (Refereed) Published
Abstract [en]

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.
Keyword [en]
Clos networks; Edge coloring; Matching; Optimization; Switches
National Category
Mathematics
Identifiers
URN: urn:nbn:se:liu:diva-18834DOI: 10.1007/s10852-008-9090-0OAI: oai:DiVA.org:liu-18834DiVA: diva2:221881
Note
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. http://dx.doi.org/10.1007/s10852-008-9090-0 Copyright: Springer Science Business Media http://www.springerlink.com/ Available from: 2009-06-05 Created: 2009-06-05 Last updated: 2013-08-29

Open Access in DiVA

fulltext(270 kB)461 downloads
File information
File name FULLTEXT01.pdfFile size 270 kBChecksum SHA-512
d1d3dfc09a930db7c7eff55d6e8eebd674c85735f61db9b4d923278bcf146f78f277ad0137091348595901862925c8297a2099640462493ce5096335b0604033
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records BETA

Holmberg, Kaj

Search in DiVA

By author/editor
Holmberg, Kaj
By organisation
Optimization The Institute of Technology
Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 461 downloads
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

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 473 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf