A reconfigurable network is a circuit-switched network where the effective topology and capacities can be dynamically adapted to changes in the traffic requirements or to changes in the structure of the network due to failures.The application of reconfigurable networks considered in this paper is data communications.We formulated the joint topology,capacity and routing problem in a reconfigurable network as a nonlinear mixed integer programming problem.To solve this problem,we present an algorithm which is a partial branch and bound algorithm.The reduced gradient method is used to solve the problem with the integrality constraints relaxed.In the computational experiments,the algorithm found good solutions and lower bounds in a few minutes of CPU time.In addition,the reduction in the minimal delay due to the reconfiguration capability can be as large as 66%.
展开▼
