A dynamic programming algorithm for the local access telecommunication network expansion problem

In this paper we consider the local access telecommunication network expansion problem, in which growing demand can be satisfied by expanding cable capacities and/or installing concentrators in the network. The problem is known to be NP-hard. We prove that the problem is weakly NP-hard, and present a pseudo-polynomial dynamic programming algorithm for the problem, with time complexity OOnB 2 U and storage requirements OOnBU, where n refers to the size of the network, and B to an upper bound on concentrator capacity. The cost structure in the network is assumed to be decomposable, but may be non-convex, non-concave, and node and edge dependent otherwise. This allows for incorporation of many aspects occurring in practical planning problems. Computational results indicate that the algorithm is very eAcient and can solve medium to large scale problems to optimality within (fractions of) seconds to minutes. ” 2000 Elsevier Science B.V. All rights reserved.

[1]  Daniel Bienstock,et al.  Computational experience with an effective heuristic for some capacity expansion problems in local access networks , 1993, Telecommun. Syst..

[2]  Oktay Günlük,et al.  Capacitated Network Design - Polyhedral Structure and Computation , 1996, INFORMS J. Comput..

[3]  Alexander Shulman,et al.  An algorithm for capacity expansion of local access networks , 1990, Proceedings. IEEE INFOCOM '90: Ninth Annual Joint Conference of the IEEE Computer and Communications Societies@m_The Multiple Facets of Integration.

[4]  Hasan Pirkul,et al.  Locating concentrators in centralized computer networks , 1992, Ann. Oper. Res..

[5]  T. Magnanti,et al.  Modeling and heuristic worst-case performance analysis of the two-level network design problem , 1994 .

[6]  Laurence A. Wolsey,et al.  Packing and covering a tree by subtrees , 1986, Comb..

[7]  D. S. Johnson,et al.  On Knapsacks, Partitions, and a New Dynamic Programming Technique for Trees , 1983, Math. Oper. Res..

[8]  Bezalel Gavish,et al.  Topological design of telecommunication networks-local access design methods , 1991, Ann. Oper. Res..

[9]  T. Magnanti,et al.  A Dual-Based Algorithm for Multi-Level Network Design , 1994 .

[10]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[11]  Thomas L. Magnanti,et al.  A Decomposition Algorithm for Local Access Telecommunications Network Expansion Planning , 1995, Oper. Res..

[12]  Arie M. C. A. Koster,et al.  A dynamic programming algorithm for the local access network expansion problem , 1996 .

[13]  Oktay Günlük,et al.  Minimum cost capacity installation for multicommodity network flows , 1998, Math. Program..

[14]  Thomas L. Magnanti,et al.  Network Design and Transportation Planning: Models and Algorithms , 1984, Transp. Sci..

[15]  Athanasios Migdalas,et al.  A characterization of the uncapacitated network design polytope , 1992, Oper. Res. Lett..

[16]  José Pinto Paixão,et al.  Dynamic programming based heuristics for the topological design of local access networks , 1991, Ann. Oper. Res..

[17]  Abraham P. Punnen,et al.  Optimal expansion of capacitated transshipment networks , 1996 .

[18]  Martin Grötschel,et al.  Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements , 1995, Oper. Res..

[19]  Bezalel Gavish,et al.  Lower Bounding Procedures for Multiperiod Telecommunications Network Expansion Problems , 1995, Oper. Res..

[20]  N. Sancho.  A suboptimal solution to a hierarchial network design problem using dynamic programming , 1995 .

[21]  Martin Grötschel,et al.  Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints , 1992, Oper. Res..

[22]  Sheng-Roan Kai,et al.  Design and Implementation of an Interactive Optimization System for Telephone Network Planning , 1992, Oper. Res..

[23]  B. Gavish.  Topological design of computer communication networks — The overall design problem , 1992 .

[24]  Thomas L. Magnanti,et al.  Working Paper Alfred P. Sloan School of Management "models for Planning Capacity Expansion in Local Access Telecommunication Networks" "models for Planning Capacity Expansion in Local Access Telecommunication Networks" Models for Planning Capacity Expansion in Local Access Telecommunication Networks , 2008 .