Abstract
The design of the topology of a local access network is a complex process which builds on many different combinatorial optimization problems such as the concentrator quantity problem, the concentrator location problem, the terminal clustering problem and the terminal layout problem. Usually, these four subproblems are solved separably and sequentially and the solution of one subproblem is used as data for the next subproblem. There are two main drawbacks associated to this four‐phase approach: i) without knowing the optimal solution to the global problem it is difficult to set the parameters for some of the subproblems which appear in the earlier phases and ii) in many cases, wrong decisions taken at one of the earlier phases are “passed” to the subsequent phases. Our aim in this paper is to formulate the two last subproblems, clustering and layout, as one single generalized capacitated tree problem. We formulate the clustering/layout problem as a capacitated single‐commodity network flow problem with adequate capacities on the arcs. We adapt a reformulation presented in (Gouveia, 1995) of a single‐commodity flow model presented in (Gavish, 1983). We present several inequalities which can be used to tighten the LP relaxation of the original formulation. We present two heuristics for obtaining feasible solutions for the clustering/layout problem. Computational results taken from tests with 50, 100 and 200 nodes indicate that in most of the cases the best heuristic produces topologies with lower cost than the ones obtained by solving separately and sequentially the two individual subproblems.
Similar content being viewed by others
References
K. Altinkemer, Parallel savings heuristics for designing multicenter tree networks, Technical Report (1989).
A. Amberg, W. Domschke and S. Voß, Capacitated minimum spanning trees: algorithms using intelligent search, Technical Report, Technische Universität Braunschweig (1995).
J. Coimbra and L. Gouveia, Lower bounding and upper bounding methods for a K-cardinality minimal tree problem, paper presented at the 3rd INFORMS Telecommunications Conference, Boca Raton (March 1995).
L. Esau and K. Williams, On teleprocessing system design, Part II: A method for approximating the optimal network, IBM Syst. J. 5 (1966) 142–147.
B. Gavish, Formulations and algorithms for the capacitated minimal directed tree problem, J. Assoc. Comput. Mach. 30(1) (1983) 118–132.
B. Gavish, Augmented Lagrangian based algorithms for centralized network design, IEEE Trans. Commun. 33 (1985) 1247–1257.
B. Gavish, Topological design of telecommunication networks - survey of local access network design methods, Ann. Oper. Res. 33 (1991) 17–71.
B. Gavish and K. Altinkemer, Parallel savings heuristics for the topological design of local access tree networks, in: '86 Conference (1986).
L. Gouveia, A comparison of directed formulations for the capacitated minimal spanning tree problem, Telecommunications Systems 1 (1993) 51–76.
L. Gouveia, A 2n-constraint formulation for the capacitated minimal spanning tree problem, Oper. Res. 43 (1995) 130–141.
L. Gouveia and P. Martins, An extended flow based formulation for the capacitated minimal spanning tree problem, paper presented at the 3rd INFORMS Telecommunications Conference, Boca Raton (March 1995).
L. Gouveia and J. Paixão, Dynamic programming based heuristics for the topological design of local access networks, Ann. Oper. Res. 33 (1991) 305–327.
L. Hall, Integer programming formulations for designing a centralized processing network, Technical Report, Department of Mathematical Sciences, Johns Hopkins University (1993).
L. Hall, Experience with a cutting plane approach for the capacitated spanning tree problem, INFORMS J. Computing 8 (1996) 219–234.
M. Karnaugh, A new class of algorithms for multipoint network optimization, IEEE Trans. Commun. 24(5) (1976) 500–505.
A. Kershenbaum, R. Boorstyn and R. Oppenheim, Second-order greedy algorithms for centralized network design, IEEE Trans. Commun. 28(10) (1980) 1835–1838.
M.J. Lopes, Árvore de suporte de custo mínimo com restrições de capacidade em dois níveis, Master Thesis, Faculdade de Ciências da Universidade de Lisboa (January 1993).
T. Magnanti and L. Wolsey, Optimal trees, in: Network Models, Handbooks in Operations Research and Management Science 7 (1995) pp. 503–615.
J. Paixão and L. Gouveia, Métodos de investigação operacional na idealização topológica de redes centralizadas, in: Actas do 4°Congresso Português de Informática, Vol. 2b (1986) pp. 1625–1655.
C. Papadimitriou, The complexity of the capacitated tree problem, Networks 8 (1978) 217–230.
Y. Sharaiha, M. Gendreau, G. Laporte and I. Osman, A Tabu Search algorithm for the capacitated shortest spanning tree problem, Technical Report CRT-95–79, C.R.T., Université de Montreal (1995).
A. Tanenbaum, Computer Networks (Prentice-Hall, Englewood Cliffs, NJ, 1977).
S. Voß, Steiner-Probleme in Graphen, Mathematical Systems in Economics 120 (Anton Hain Verlag, 1990).
R. Wong, A dual ascent approach to Steiner tree problems on a directed graph, Math. Programming 28 (1984) 271–287.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Gouveia, L., Lopes, M.J. Using generalized capacitated trees for designing the topology of local access networks. Telecommunication Systems 7, 315–337 (1997). https://doi.org/10.1023/A:1019184615054
Issue Date:
DOI: https://doi.org/10.1023/A:1019184615054