A LOGICAL TOPOLOGY AND DISCRETE CAPACITY ASSIGNMENT ALGORITHM FOR RECONFIGURABLE NETWORKS
成果类型：
Article
署名作者：
LEE, MJ; YEE, JR
署名单位：
University of Hawaii System
刊物名称：
OPERATIONS RESEARCH
ISSN/ISSBN：
0030-364X
DOI：
10.1287/opre.43.1.102
发表日期：
1995
页码：
102-116
关键词：
摘要：
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 a partial branch-and-bound algorithm. The reduced gradient method is used to solve the problem with the integrality constraints relaxed. Lagrangian relaxation is applied to obtain lower bounds. In the computational experiments, the algorithm found good solutions 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 62%.