Abstract
We consider the telecommunications network design problem of simultaneously determining at which locations to place a switch, interconnecting all switches with backbone trunks, and connecting each location to some switch by an access circuit. We assume there are no capacity constraints, and minimize the sum of switch, backbone trunk, and access circuit costs using a dual ascent method that solves a sequence of dual uncapacitated facility location problems. A Steiner tree based heuristic provides a primal feasible design. On 15 random problems with 100 locations, the average duality gap is 2.0%.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. Balakrishnan, T.L. Magnanti and R.T. Wong, A dual-ascent procedure for large-scale uncapacitated network design, Operations Research 37 (1989) 716-740.
O. Bilde and J. Krarup, Sharp lower bounds and efficient algorithms for the simple plant location problem, Annals of Discrete Mathematics 1 (1977) 79-97.
S. Chamberland, B. Sanso and O. Marcotte, Topological design of two level telecommunication networks with modular switches, GERAD (Montréal), Report G-97-29 (1997).
S.H. Chung, Y.S. Myung and D.W. Tcha, Optimal design of a distributed network with a two-level hierarchical structure, European Journal of Operational Research 62 (1992) 105-115.
D. Erlenkotter, A dual based procedure for uncapacitated facility location, Operations Research 26 (1978) 992-1009.
R.L. Francis, L.F. McGinnis, Jr. and J.A. White, Facility Layout and Location: An Analytical Approach (Prentice-Hall, Englewood Cliffs, NJ, 1992).
B. Gavish, Topological design of computer communication networks — The overall problem, European Journal of Operational Research 58 (1992) 149-172.
B. Gavish and H. Pirkul, Computer and database location in distributed systems, IEEE Transactions on Computers 35 (1986) 583-589.
J.G. Kim and D.W. Tcha, Optimal design of a two-level hierarchical network with tree-star configuration, Computers and Industrial Engineering 22 (1992) 273-281.
L. Kou, G. Markowsky and L. Berman, A fast algorithm for steiner trees, Acta Informatica 15 (1981) 141-145.
C. Lee, H. Ro and D. Tcha, Topological design of a two-level network with ring-star configuration, Computers and Operations Research 20 (1993) 625-637.
A. Lucena and J.E. Beasley, A branch and cut algorithm for the Steiner problem in graphs, Networks 31 (1998) 39-59.
A. Mirzaian, Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds, Networks 15 (1985) 1-20.
R.T. Wong, A dual ascent approach for Steiner tree problems on a directed graph, Mathematical Programming 28 (1984) 271-287.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Rosenberg, E. Dual Ascent for Uncapacitated Telecommunications Network Design with Access, Backbone, and Switch Costs. Telecommunication Systems 16, 423–435 (2001). https://doi.org/10.1023/A:1016623229800
Issue Date:
DOI: https://doi.org/10.1023/A:1016623229800