%0 Book Section %1 Pioro2001629 %A Pióro, M. %A Jüttner, A. %A Harmatos, J. %A Szentesi, Á. %A Gajowniczek, P. %A Mys?ek, A. %B Teletraffic Engineering in the Internet EraProceedings of the International Teletraffic Congress - ITC-I7 %D 2001 %E Jorge Moreira de Souza, Nelson L.S. da Fonseca %E de Souza e Silva, Edmundo A. %I Elsevier %K itc itc17 %P 629 - 642 %R http://dx.doi.org/10.1016/S1388-3437(01)80157-8 %T Topological design of telecommunication networks Nodes and links localization under demand constraints %V 4 %X The paper addresses the classical network optimization problem consisting in realizing the assumed set of demands in a given network with a given list of potential nodes' and links' locations and with the objective function reflecting the cost of the actual links' capacities as well as the fixed cost of installing nodes and links. We assume that the network nodes are composed of two disjoint sets: the set of access nodes and the set of transit nodes. The access (end) nodes only generate demands and do not transit the end-to-end flows realizing the demands while the transit nodes do not generate demands and do transit the end-to-end flows. The selection of the actually installed transit nodes and of the links interconnecting all the network nodes is the major subject of optimization. Although similar problems have been considered in the past, also in the context of the road traffic, it is the authors' conviction that there is still a lot of room for improvement as far as solution methods are concerned. In the paper we overview the existing problem formulations and solution methods. We also propose our own approaches, based both on original ideas and on improvements of the existing ones. The effectiveness of the solutions is illustrated by means of a numerical study.

@incollection{Pioro2001629, abstract = {The paper addresses the classical network optimization problem consisting in realizing the assumed set of demands in a given network with a given list of potential nodes' and links' locations and with the objective function reflecting the cost of the actual links' capacities as well as the fixed cost of installing nodes and links. We assume that the network nodes are composed of two disjoint sets: the set of access nodes and the set of transit nodes. The access (end) nodes only generate demands and do not transit the end-to-end flows realizing the demands while the transit nodes do not generate demands and do transit the end-to-end flows. The selection of the actually installed transit nodes and of the links interconnecting all the network nodes is the major subject of optimization. Although similar problems have been considered in the past, also in the context of the road traffic, it is the authors' conviction that there is still a lot of room for improvement as far as solution methods are concerned. In the paper we overview the existing problem formulations and solution methods. We also propose our own approaches, based both on original ideas and on improvements of the existing ones. The effectiveness of the solutions is illustrated by means of a numerical study. }, added-at = {2016-07-12T14:53:52.000+0200}, author = {Pióro, M. and Jüttner, A. and Harmatos, J. and Szentesi, Á. and Gajowniczek, P. and Mys?ek, A.}, biburl = {https://www.bibsonomy.org/bibtex/2bcccae8019788ecc51f9227abd9f5787/itc}, booktitle = {Teletraffic Engineering in the Internet EraProceedings of the International Teletraffic Congress - ITC-I7}, doi = {http://dx.doi.org/10.1016/S1388-3437(01)80157-8}, editor = {Jorge Moreira de Souza, Nelson L.S. da Fonseca and de Souza e Silva, Edmundo A.}, interhash = {266c7e6cf96366c154aedf0869200104}, intrahash = {bcccae8019788ecc51f9227abd9f5787}, issn = {1388-3437}, keywords = {itc itc17}, pages = {629 - 642}, publisher = {Elsevier}, series = {Teletraffic Science and Engineering }, timestamp = {2020-04-30T18:17:29.000+0200}, title = {Topological design of telecommunication networks Nodes and links localization under demand constraints }, volume = 4, year = 2001 }