A Logical Topology and Discrete Capacity Assignment Algorithm for Reconfigurable Networks

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%.

[1]  Bezalel Gavish,et al.  Backbone Network Design Tools with Economic Tradeoffs , 1990, INFORMS J. Comput..

[2]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

[3]  D. Bertsekas,et al.  Projected Newton methods and optimization of multicommodity flows , 1982, 1982 21st IEEE Conference on Decision and Control.

[4]  Frank Yeong-Sung Lin,et al.  A routing algorithm for virtual circuit data networks with multiple sessions per O - D pair , 1992, Networks.

[5]  Mario Gerla,et al.  Topology design and bandwidth allocation in ATM nets , 1989, IEEE J. Sel. Areas Commun..

[6]  Mario Gerla,et al.  Optimal Routing in a Packet-Switched Computer Network , 1974, IEEE Transactions on Computers.

[7]  W. Hutcheson,et al.  Control Services Based on Digital Cross-Connect Systems , 1987, IEEE J. Sel. Areas Commun..

[8]  Doan B. Hoang,et al.  Joint Optimization of Capacity and Flow Assignment in a Packet-Switched Communications Network , 1987, IEEE Trans. Commun..

[9]  J. S. Fleischman,et al.  Operations planning for the information age [telecommunication networks] , 1988, IEEE J. Sel. Areas Commun..

[10]  M. Gerla,et al.  Topological reconfiguration of ATM networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[11]  Philip Wolfe,et al.  Validation of subgradient optimization , 1974, Math. Program..

[12]  Sidney L. Hantler,et al.  An Algorithm for Optimal Route Selection in SNA Networks , 1983, IEEE Trans. Commun..

[13]  Ming-Jeng Lee,et al.  An efficient near-optimal algorithm for the joint traffic and trunk routing problem in self-planning networks , 1989, IEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies.