Graph Optimization Approaches for Minimal Rerouting in Symmetric Three Stage Clos Networks |
| |
Authors: | Kaj Holmberg |
| |
Institution: | 1. Department of Mathematics, Link?ping Institute of Technology, 581 83, Link?ping, Sweden
|
| |
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. |
| |
Keywords: | Clos networks Switches Edge coloring Matching Optimization |
本文献已被 SpringerLink 等数据库收录! |
|