A partial branch and bound design algorithm for reconfigurable networks

Author

Lee, Ming-Jeng ; Yee, James R.

Author_Institution

Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA, USA

fYear

1991

fDate

23-26 Jun 1991

Firstpage

682

Abstract

The joint topology, capacity and routing problem in a reconfigurable network is formulated as a nonlinear mixed integer programming problem. To solve this problem, an algorithm is presented 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%

Keywords

circuit switching; integer programming; nonlinear programming; telecommunication networks; CPU time; circuit switched network; delay; design algorithm; lower bounds; network capacity; network routing; network topology; nonlinear mixed integer programming; partial branch and bound algorithm; reconfigurable networks; reduced gradient method; Algorithm design and analysis; Circuit topology; Contracts; Data communication; Decision support systems; Distributed control; Network topology; Routing; Telecommunication network topology; Telecommunication traffic;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications, 1991. ICC '91, Conference Record. IEEE International Conference on

Conference_Location

Denver, CO

Print_ISBN

0-7803-0006-8

Type

conf

DOI

10.1109/ICC.1991.162449

Filename

162449