Optimization Models for Routing in Switching Networks of Clos Type with Many Stages
Optimization Models for Routing in Switching Networks of Clos Type with Many Stages
复制标题
多级Clos型交换网路由优化模型
DOI：
--
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
K. Holmberg
中科院分区：
文献类型：
--
作者：
K. Holmberg
我们提出了优化模型的问题，同时通过一个对称的Clos网络的连接路由，并为问题的最小重新路由以前路由的连接时，一个新的连接被路由。该模型可作为求解方法的基础，如与拉格朗日松弛相结合的重路由算法。这些方法可以一起给出所需重排的最佳数量的界限。这是针对具有三个阶段、五个阶段、七个阶段以及任意数量阶段的Clos网络完成的
We present optimization models for the problem of simultaneous routing of connections through a symmetric Clos network, and for the problem of minimal rerouting of previously routed connections when a new connection is to be routed. The models can be used as base for solution methods, such as heuristics for rerouting combined with Lagrangean relaxation. These approaches can together give bounds on the optimal number of rearrangements needed. This is done for Clos networks with three stages, five stages, seven stages, and for an arbitrary number of stages