TY - GEN A1 - Orlowski, Sebastian A1 - Wessäly, Roland T1 - An Integer Programming Model for Multi-Layer Network Design N2 - We present an integer linear programming model for the design of multi-layer telecommunication networks. The formulation integrates hardware, capacity, routing, and grooming decisions in \emph{any} n umber of network layers. Practical hardware restrictions and cost can accurately be taken into account for technologies based on connection-oriented routing protocols. T3 - ZIB-Report - 04-49 KW - multi-layer networks KW - integer programming KW - network design KW - routing KW - grooming Y1 - 2004 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8248 ER - TY - GEN A1 - Kröller, Alexander A1 - Wessäly, Roland T1 - Integrated Optimization of Hardware Configuration and Capacity. Dimensioning in SDH and opaque WDM networks N2 - We suggest a new model for the design of telecommunication networks which integrates decisions about the topology, configuration of the switching hardware, link dimensioning, and protected routing of communication demands. Applying the branch-and-cut-algorithm implemented in our network planning and optimization tool DISCNET, we demonstrate that real-world based network planning instances of such an enhanced model can be solved. T3 - ZIB-Report - 03-49 KW - Survivable Network Design KW - Integer Programming KW - Hardware Configuration KW - Routing KW - Network Models KW - Network Planning KW - Resource Allocation KW - Surviva Y1 - 2003 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7714 ER - TY - GEN A1 - Bley, Andreas A1 - Koch, Thorsten A1 - Wessäly, Roland T1 - Large-scale hierarchical networks: How to compute an optimal architecture? N2 - In this article, we present a mathematical model and an algorithm to support one of the central strategic planning decisions of network operators: How to organize a large number of locations into a hierarchical network? We propose a solution approach that is based on mixed-integer programming and Lagrangian relaxation techniques. As major advantage, our approach provides not only solutions but also worst-case quality guarantees. Real-world scenarios with more than 750 locations have been solved within 30 minutes to less than 1\% off optimality. T3 - ZIB-Report - 04-04 KW - Hierarchical Networks KW - Mixed-Integer Programming KW - Lagrangian Relaxation Y1 - 2004 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7799 ER - TY - GEN A1 - Koch, Thorsten A1 - Wessäly, Roland T1 - Hierarchical Infrastructure Planning in Networks N2 - In this article, strategical infrastructure planning problems in the design of large-scale telecommunication networks are discussed based on experiences from three projects with industrial partners: The access network planning of the German Gigabit-Wissenschaftsnetz (G-WiN) for DFN (Verein zur Förderung eines Deutschen Forschungsnetzes e.V.), the mobile network switching center location planning project for E-Plus Mobilfunk, and the fixed network switching center location planning project for TELEKOM AUSTRIA. We introduce a mathematical model for a hierarchical multi-commodity capacitated facility location problem, present adaptions of this basic model to the specific requirements within the different projects and discuss the individual peculiarities and model decisions made. Eventually, we present and discuss computational results of three associated case studies, illustrating '"how we did the job`` with mathematical methods. T3 - ZIB-Report - 04-42 KW - Facility Location KW - Telecommunication KW - Mixed Integer Programming Y1 - 2004 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8174 ER - TY - GEN A1 - Orlowski, Sebastian A1 - Koster, Arie M.C.A. A1 - Raack, Christian A1 - Wessäly, Roland T1 - Two-layer Network Design by Branch-and-Cut featuring MIP-based Heuristics N2 - This paper deals with MIP-based primal heuristics to be used within a branch-and-cut approach for solving multi-layer telecommunication network design problems. Based on a mixed-integer programming formulation for two network layers, we present three heuristics for solving important subproblems, two of which solve a sub-MIP. On multi-layer planning instances with many parallel logical links, we show the effectiveness of our heuristics in finding good solutions early in the branch-and-cut search tree. T3 - ZIB-Report - 06-47 KW - multi-layer network design KW - integer programming KW - branch-and-cut KW - heuristics Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-9412 ER - TY - GEN A1 - Hülsermann, Ralf A1 - Jäger, Monika A1 - Koster, Arie M.C.A. A1 - Orlowski, Sebastian A1 - Wessäly, Roland A1 - Zymolka, Adrian T1 - Availability and Cost Based Evaluation of Demand-wise Shared Protection N2 - In this paper, we investigate the connection availabilities for the new protection scheme Demand-wise Shared Protection (DSP) and describe an appropriate approach for their computation. The exemplary case study on two realistic network scenarios shows that in most cases the availabilities for DSP are comparable with that for 1+1 path protection and better than in case of shared path protection. T3 - ZIB-Report - 06-15 KW - demand-wise shared protection KW - network availability KW - network optimization Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-9080 ER - TY - GEN A1 - Gruber, Claus G. A1 - Koster, Arie M.C.A. A1 - Orlowski, Sebastian A1 - Wessäly, Roland A1 - Zymolka, Adrian T1 - A new model and a computational study for Demand-wise Shared Protection N2 - This report combines the contributions to INOC 2005 (Wessälly et al., 2005) and DRCN 2005 (Gruber et al., 2005). A new integer linear programming model for the end-to-end survivability concept deman d-wise shared protection (DSP) is presented. DSP is based on the idea that backup capacity is dedicated to a particular demand, but shared within a demand. It combines advantages of dedicated and shared protection: It is more cost-efficient than dedicated protection and operationally easier than shared protection. In a previous model for DSP, the number of working and backup paths to be configured for a particular demand has been an input parameter; in the more general model for DSP investigated in this paper, this value is part of the decisions to take. To use the new DSP model algorithmically, we suggest a branch-and-cut approach which employs a column generation procedure to deal with the exponential number of routing variables. A computational study to compare the new resilience mechanism DSP with dedicated and shared path protection is performed. The results for five realistic network planning scenarios reveal that the best solutions for DSP are on average 15\% percent better than the corresponding 1+1 dedicated path protection solutions, and only 15\% percent worse than shared path protection. T3 - ZIB-Report - 05-55 KW - demand-wise shared protection KW - resilience KW - network design KW - integer linear programming Y1 - 2005 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8880 ER - TY - CHAP A1 - Eisenblätter, Andreas A1 - Koch, Thorsten A1 - Martin, Alexander A1 - Achterberg, Tobias A1 - Fügenschuh, Armin A1 - Koster, Arie M.C.A. A1 - Wegel, Oliver A1 - Wessäly, Roland ED - Anandalingam, G. ED - Raghavan, S. T1 - Modelling Feasible Network Configurations for UMTS T2 - Telecommunications Network Design and Management Y1 - 2003 UR - http://opus.kobv.de/zib/volltexte/2002/684/ PB - Kluver ER - TY - CHAP A1 - Bley, Andreas A1 - Koch, Thorsten A1 - Wessäly, Roland ED - Kaindl, H. T1 - Large-Scale hierarchical networks: How to compute an optimal architecture? T2 - Networks 2004 Y1 - 2004 SN - 3-8007-2840-0 SP - 429 EP - 434 PB - VDE Verlag CY - Berlin ER - TY - CHAP A1 - Koch, Thorsten A1 - Wessäly, Roland ED - Elmer, Carl-Friedrich ED - von Hirschhausen, Christian T1 - Hierarchical Infrastructure Planning in Networks T2 - Proceedings of the 3rd Conference on Applied Infrastructure Research, 9. October 2004, Berlin Y1 - 2004 UR - http://opus.kobv.de/zib/volltexte/2004/818/ ER - TY - GEN A1 - Alevras, Dimitris A1 - Grötschel, Martin A1 - Wessäly, Roland T1 - Cost-Efficient Network Synthesis from Leased Lines N2 - Given a communication demand between each pair of nodes of a network we consider the problem of deciding what capacity to install on each edge of the network in order to minimize the building cost of the network and to satisfy the demand between each pair of nodes. The feasible capacities that can be leased from a network provider are of a particular kind in our case. There are a few so-called basic capacities having the property that every basic capacity is an integral multiple of every smaller basic capacity. An edge can be equipped with a capacity only if it is an integer combination of the basic capacities. We treat, in addition, several restrictions on the routings of the demands (length restriction, diversification) and failures of single nodes or single edges. We formulate the problem as a mixed integer linear programming problem and develop a cutting plane algorithm as well as several heuristics to solve it. We report on computational results for real world data. T3 - ZIB-Report - SC-97-22 Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-2912 ER - TY - GEN A1 - Alevras, Dimitris A1 - Grötschel, Martin A1 - Wessäly, Roland T1 - Capacity and Survivability Models for Telecommunication Networks N2 - Designing low-cost networks that survive certain failure situations is one of the prime tasks in the telecommunication industry. In this paper we survey the development of models for network survivability used in practice in the last ten years. We show how algorithms integrating polyhedral combinatorics, linear programming, and various heuristic ideas can help solve real-world network dimensioning instances to optimality or within reasonable quality guarantees in acceptable running times. The most general problem type we address is the following. Let a communication demand between each pair of nodes of a telecommunication network be given. We consider the problem of choosing, among a discrete set of possible capacities, which capacity to install on each of the possible edges of the network in order to (i) satisfy all demands, (ii) minimize the building cost of the network. \noindent In addition to determining the network topology and the edge capacities we have to provide, for each demand, a routing such that (iii) no path can carry more than a given percentage of the demand, (iv) no path in the routing exceeds a given length. \noindent We also have to make sure that (v) for every single node or edge failure, a certain percentage of the demand is reroutable. \noindent Moreover, for all failure situations feasible routings must be computed. The model described above has been developed in cooperation with a German mobile phone provider. We present a mixed-integer programming formulation of this model and computational results with data from practice. T3 - ZIB-Report - SC-97-24 Y1 - 1997 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-2931 ER - TY - GEN A1 - Alevras, Dimitris A1 - Grötschel, Martin A1 - Jonas, Peter A1 - Paul, Ulrich A1 - Wessäly, Roland T1 - Survivable Mobile Phone Architectures: Models and Solution Methods N2 - In the highly competitive area of telecommunications, cost, quality, and network management are among the most important aspects to be considered when designing a network. We study the problem of dimensioning a telecommunication network that is still operating in case of a failure of a network component. Given a demand between each pair of nodes of a telecommunication network and a finite set of possible capacities for each edge of the network, we consider the problem of deciding what capacity to install on each edge of the network in order to minimize the building cost of the network and to satisfy the demand between each pair of nodes, even if a network component fails. The routing of the demands must satisfy the following additional restrictions: (a) there is a maximum number of nodes allowed in each path between any pair of nodes (path length restriction), and (b) there is a maximum percentage of the demand between each pair of nodes that can be routed through any network component (diversification restriction). Moreover, the chosen capacities must be such that, for every single node or single edge failure, a certain percentage of the demand between any pair of nodes is reroutable (i.e. it ``survives'' the particular failure). We formulate the problem as a mixed integer linear programming problem and present a cutting plane algorithm as well as several heuristics for its solution. Furthermore, we discuss several ways to implement survivability into a telecommunication network. T3 - ZIB-Report - SC-96-48 Y1 - 1996 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-2582 ER - TY - GEN A1 - Alevras, Dimitris A1 - Grötschel, Martin A1 - Wessäly, Roland T1 - A Network Dimensioning Tool N2 - Designing low cost networks that survive certain failure situations belongs to one of the prime tasks in the telecommunications industry. In this paper we describe a mathematical model combining several aspects of survivability that are elsewhere treated in a hierarchical fashion. We present mathematical investigations of this integrated model, a cutting plane algorithm, as well as several heuristics for its solution. Moreover, we report computational results with real world data. The problem we address is the following. Suppose, between each pair of nodes in a region, a communication demand is given. We want to determine the topology of a telecommunication network connecting the given nodes and to dimension all potential physical links. For each link, the possible capacities are restricted to a given finite set. The capacities must be chosen such that the communication demands are satisfied, even if certain network components fail, and such that the network building costs are as small as possible. Moreover, for each pair of nodes and each failure situation, we want to determine the paths on which the demand between the nodes is routed. T3 - ZIB-Report - SC-96-49 Y1 - 1996 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-2591 ER - TY - GEN A1 - Bley, Andreas A1 - Grötschel, Martin A1 - Wessäly, Roland T1 - Design of Broadband Virtual Private Networks: Model and Heuristics for the B–WiN N2 - We investigate the problem of designing survivable broadband virtual private networks that employ the Open Shortest Path First (OSPF) routing protocol to route the packages. The capacities available for the links of the network are a minimal capacity plus multiples of a unit capacity. Given the directed communication demands between all pairs of nodes, we wish to select the capacities in a such way, that even in case of a single node or a single link failure a specified percentage of each demand can be satisfied and the costs for these capacities are minimal. We present a mixed--integer linear programming formulation of this problem and several heuristics for its solution. Furthermore, we report on computational results with real-world data. T3 - ZIB-Report - SC-98-13 KW - Telecommunication Network Design KW - Survivable Networks KW - Network Capacity Planning KW - OSPF Routing KW - Shortest Path Routing KW - Heuristics Y1 - 1998 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-3565 ER - TY - JOUR A1 - Raack, Christian A1 - Koster, Arie M.C.A. A1 - Orlowski, Sebastian A1 - Wessäly, Roland T1 - On cut-based inequalities for capacitated network design polyhedra JF - Networks Y1 - 2011 UR - http://onlinelibrary.wiley.com/doi/10.1002/net.20395/abstract VL - 57 IS - 2 SP - 141 EP - 156 ER - TY - GEN A1 - Bley, Andreas A1 - Koster, Arie M.C.A. A1 - Kröller, Alexander A1 - Wessäly, Roland A1 - Zymolka, Adrian T1 - Kosten- und Qualitätsoptimierung in Kommunikationsnetzen N2 - Der scharfe Wettbewerb innerhalb der Telekommunikationsbranche zwingt die Netzbetreiber dazu, ihre Investitionen genau zu planen und immer wieder Einsparungsmanahmen durchzuführen. Gleichzeitig ist es jedoch wichtig, die Qualität der angebotenen Dienste zu verbessern, um neue Kunden zu gewinnen und langfristig an sich zu binden. Die mathematische Optimierung bietet sich für viele solcher Aufgabenstellungen als hervorragend geeignetes Planungswerkzeug an. Ziel dieses Artikels ist es, ihre Methodik und ihre Anwendung speziell zur Kosten- und Qualitätsoptimierung in Kommunikationsnetzen vorzustellen. Anhand von vier konkreten Planungsaufgaben aus dem Bereich der Festnetzplanung wird aufgezeigt, wie sich komplexe Zusammenhänge in flexiblen mathematischen Modellen abbilden lassen und welche Verfahren zur automatisierten Bearbeitung der Probleme eingesetzt werden können. Die hier vorgestellten Methoden zeichnen sich insbesondere dadurch aus, dass sie neben hochwertigen Lösungen auch eine Qualittsgarantie liefern, mit der sich die Lsungen fundiert bewerten lassen. Die dokumentierten Ergebnisse aus verschiedenen Industrieprojekten belegen die Eignung und Güte der mathematischen Optimierung für die Praxis. T3 - ZIB-Report - 03-31 Y1 - 2003 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7537 ER - TY - GEN A1 - Orlowski, Sebastian A1 - Wessäly, Roland T1 - Comparing Restoration Concepts using Optimal Network Configurations with Integrated Hardware and Routing Decisions N2 - We investigate the impact of link and path restoration on the cost of telecommunication networks. The surprising result is the following: the cost of an optimal network configuration is almost independent of the restoration concept if (i) the installation of network elements (ADMs, DXCs, or routers) and interface cards, (ii) link capacities, and (iii) working and restoration routings are simultaneously optimized. We present a mixed-integer programming model which integrates all these decisions. Using a branch-and-cut algorithm (with column generation to deal with all potential routing paths), we solve structurally different real-world problem instances and show that the cost of optimal solutions is almost independent of the used restoration concept. In addition, we optimize spare capacities for given shortest working paths which are predetermined with respect to different link metrics. In comparison to simultaneous optimization of working and restoration routings, it turns out that this approach does not allow to obtain predictably good results. T3 - ZIB-Report - 03-09 KW - survivable network design KW - link and path restoration KW - hardware configuration KW - branch-and-cut algorithm KW - routing Y1 - 2003 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7316 ER - TY - GEN A1 - Eisenblätter, Andreas A1 - Koster, Arie M.C.A. A1 - Wallbaum, Randolf A1 - Wessäly, Roland T1 - Load Balancing in Signaling Transfer Points N2 - Signaling is crucial to the operation of modern telecommunication networks. A breakdown in the signaling infrastructure typically causes customer service failures, incurs revenue losses, and hampers the company image. Therefore, the signaling network has to be highest reliability and survivability. This in particular holds for the routers in such a network, called \textit{signaling transfer points\/} (STPs). The robustness of an STP can be improved by equally distributing the load over the internal processing units. Several constraints have to be taken into account. The load of the links connected to a processing unit changes over time introducing an imbalance of the load. In this paper, we show how integer linear programming can be applied to reduce the imbalance within an STP, while keeping the number of changes small. Two alternative models are presented. Computational experiments validate the integer programming approach in practice. The GSM network operator E-Plus saves substantial amounts of time and money by employing the proposed approach. T3 - ZIB-Report - 02-50 KW - Signaling network KW - STP KW - load-balancing KW - integer programming KW - computations Y1 - 2002 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7179 ER - TY - GEN A1 - Zymolka, Adrian A1 - Koster, Arie M.C.A. A1 - Wessäly, Roland T1 - Transparent optical network design with sparse wavelength conversion N2 - We consider the design of transparent optical networks from a practical perspective. Network operators aim at satisfying the communication demands at minimum cost. Such an optimization involves three interdependent planning issues: the dimensioning of the physical topology, the routing of lightpaths, and the wavelength assignment. Further topics include the reliability of the configuration and sparse wavelength conversion for efficient use of the capacities. In this paper, we investigate this extensive optical network design task. Using a flexible device-based model, we present an integer programming formulation that supports greenfield planning as well as expansion planning on top of an existing network. As solution method, we propose a suitable decomposition approach that separates the wavelength assignment from the dimensioning and routing. Our method in particular provides a lower bound on the total cost which allows to rate the solution quality. Computational experiments on realistic networks approve the solution approach to be appropriate. T3 - ZIB-Report - 02-34 KW - optical network design KW - wavelength conversion KW - integer programming Y1 - 2002 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7017 ER - TY - GEN A1 - Eisenblätter, Andreas A1 - Fügenschuh, Armin A1 - Koch, Thorsten A1 - Koster, Arie M.C.A. A1 - Martin, Alexander A1 - Pfender, Tobias A1 - Wegel, Oliver A1 - Wessäly, Roland T1 - Modelling Feasible Network Configurations for UMTS N2 - A model for the optimisation of the location and configuration of base stations in a UMTS network is described. The focus is primarily on modelling the configuration problem sufficiently accurate using mixed-integer variables and (essentially) linear constraints. These constraints reflect the limited downlink code capacity in each cell, the interference limitations for successful up- and downlink transmissions, the need for sufficiently strong (cell) pilot signals, and the potential gain for mobiles from being in soft(er) hand-over. It is also explained how to use the model as a basis for rating network configurations. T3 - ZIB-Report - 02-16 KW - UMTS KW - radio interface KW - network planning KW - configuration KW - perfect power control KW - mathematical model KW - mixed integer programming KW - MOMENTUM KW - IST-20 Y1 - 2002 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6837 ER - TY - GEN A1 - Eisenblätter, Andreas A1 - Geerdes, Hans-Florian A1 - Koch, Thorsten A1 - Martin, Alexander A1 - Wessäly, Roland T1 - UMTS Radio Network Evaluation and Optimization beyond Snapshots N2 - This paper is concerned with UMTS radio network design. Our task is to reconfigure antennas and the related cells as to improve network quality. In contrast to second generation GSM networks, \emph{interference} plays a paramount role when designing third generation radio networks. A known compact formulation for assessing the interference characteristics of a radio network as coupling relations between cells based on user snapshots is generalized to statistical average load. This enables us to overcome the notorious difficulties of snapshot-based network optimization approaches. We recall a mixed-integer programming model for the network design problem that is based on user snapshots and contrast it with a new network design model based on the average coupling formulation. Exemplarily focusing on the important problem of optimizing antenna tilts, we give computational results for a fast local search algorithm and the application of a MIP solver to both models. These results demonstrate that our new average-based approaches outperform state-of-the-art snapshot models for UMTS radio network optimization. T3 - ZIB-Report - 04-15 KW - UMTS KW - Network planning KW - Network design KW - Optimization Y1 - 2004 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7903 ER - TY - GEN A1 - Orlowski, Sebastian A1 - Wessäly, Roland T1 - The Effect of Hop Limits on Optimal Cost in Survivable Network Design N2 - We investigate the impact of hop-limited routing paths on the total cost of a telecommunication network. For different survivability settings (dedicated protection, link and path restoration), the optimal network cost without restrictions on the admissible path set is compared to the results obtained with two strategies to impose hop limits on routing paths. In a thorough computational study on optimal solutions for nine real-world based problem instances, we show that hop limits should be avoided if the technology allows it and network cost is a major planning issue. In this case, column generation should be employed to deal with all routing paths. If hop-limits are required, these should be defined for each demand individually and as large as possible. T3 - ZIB-Report - 04-23 KW - survivable network design KW - hop limits KW - routing KW - restoration KW - branch-and-cut algorithm KW - mixed-integer programming Y1 - 2004 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7980 ER - TY - GEN A1 - Raack, Christian A1 - Koster, Arie M.C.A. A1 - Wessäly, Roland T1 - On the strength of cut-based inequalities for capacitated network design polyhedra N2 - In this paper we study capacitated network design problems, differentiating directed, bidirected and undirected link capacity models. We complement existing polyhedral results for the three variants by new classes of facet-defining valid inequalities and unified lifting results. For this, we study the restriction of the problems to a cut of the network. First, we show that facets of the resulting cutset polyhedra translate into facets of the original network design polyhedra if the two subgraphs defined by the network cut are (strongly) connected. Second, we provide an analysis of the facial structure of cutset polyhedra, elaborating the differences caused by the three different types of capacity constraints. We present flow-cutset inequalities for all three models and show under which conditions these are facet-defining. We also state a new class of facets for the bidirected and undirected case and it is shown how to handle multiple capacity modules by Mixed Integer Rounding (MIR). T3 - ZIB-Report - 07-08 KW - cutset-polyhedra KW - flow-cutset inequalities KW - network design KW - mixed integer programming Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-9512 ER - TY - GEN A1 - Raack, Christian A1 - Koster, Arie M.C.A. A1 - Orlowski, Sebastian A1 - Wessäly, Roland T1 - Capacitated network design using general flow-cutset inequalities N2 - This paper deals with directed, bidirected, and undirected capacitated network design problems. Using mixed integer rounding (MIR), we generalize flow-cutset inequalities to these three link types and to an arbitrary modular link capacity structure, and propose a generic separation algorithm. In an extensive computational study on 54 instances from the Survivable Network Design Library (SNDlib), we show that the performance of cplex can significantly be enhanced by this class of cutting planes. The computations reveal the particular importance of the subclass of cutset-inequalities. T3 - ZIB-Report - 07-14 KW - general flow-cutset inequalities KW - capacitated network design KW - mixed integer rounding KW - SNDlib Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-9576 ER - TY - JOUR A1 - Eisenblätter, Andreas A1 - Geerdes, Hans-Florian A1 - Koch, Thorsten A1 - Martin, Alexander A1 - Wessäly, Roland T1 - UMTS Radio Network Evaluation and Optimization beyond Snapshots JF - Mathematical Methods of Operations Research Y1 - 2005 UR - http://opus.kobv.de/zib/volltexte/2004/791/ U6 - https://doi.org/10.1007/s00186-005-0002-z VL - 63 IS - 1 SP - 1 EP - 29 ER - TY - JOUR A1 - Alevras, Dimitris A1 - Grötschel, Martin A1 - Wessäly, Roland T1 - Cost-efficient network synthesis from leased lines JF - Annals of Operations Research Y1 - 1998 VL - 76 SP - 1 EP - 20 ER - TY - JOUR A1 - Alevras, Dimitris A1 - Grötschel, Martin A1 - Jonas, Peter A1 - Paul, Uwe A1 - Wessäly, Roland T1 - Survivable Mobile Phone Network Architectures JF - IEEE Communications Magazine Y1 - 1998 SP - 88 EP - 93 ER - TY - CHAP A1 - Bley, Andreas A1 - Grötschel, Martin A1 - Wessäly, Roland ED - Dean, Nathaniel ED - Hsu, D. ED - Ravi, R. T1 - Design of broadband virtual private networks: Model and Heuristics for the B–WiN T2 - Robust communication networks: Interconnection and survivability. DIMACS workshop, Princeton, NJ, USA, 1998 at Rutgers University Y1 - 2000 VL - 53 SP - 1 EP - 16 PB - American Mathematical Society CY - Providence, RI ER - TY - CHAP A1 - Alevras, Dimitris A1 - Grötschel, Martin A1 - Wessäly, Roland ED - Barceló, Jaime T1 - Capacity and Survivability Models for Telecommunication Networks T2 - Proceedings of the EURO XV/INFORMS XXXIV Meeting, Barcelona June 1997 Y1 - 1997 PB - Universitat Politècnica de Catalunya CY - Barcelona, Spanien ER - TY - CHAP A1 - Eisenblätter, Andreas A1 - Fügenschuh, Armin A1 - Koch, Thorsten A1 - Koster, Arie M.C.A. A1 - Martin, Alexander A1 - Pfender, Tobias A1 - Wegel, Oliver A1 - Wessäly, Roland ED - G. Anandalingam, S. T1 - Mathematical Model of Feasible Network Configurations for UMTS T2 - Telecommunications network design and management Y1 - 2002 SP - 1 EP - 24 PB - Kluwer ER - TY - CHAP A1 - Menne, Ulrich A1 - Raack, Christian A1 - Wessäly, Roland A1 - Kharitonov, Daniel T1 - Optimal Degree of Optical Circuit Switching in IP-over-WDM Networks T2 - Optical Network Design and Modeling (ONDM), 2012 16th International Conference on N2 - In this paper, we study the influence of technology, traffic properties and price trends on optimized design of a reference IP-over-WDM network with rich underlying fiber topology. In each network node, we investigate the optimal degree of traffic switching in an optical (lambda) domain versus an electrical (packet) domain, also known as measure of \emph{node transparency}. This measure is studied in connection to changes in traffic volume, demand affinity, optical circuit speeds and equipment cost. By applying variable design constraints, we assess the relative roles of the two distinct equipment groups, IP routers and optical cross-connects, with respect to resulting changes in cost-sensitive network architectures. Y1 - 2012 U6 - https://doi.org/10.1109/ONDM.2012.6210206 SP - 1 EP - 6 ER - TY - CHAP A1 - Orlowski, Sebastian A1 - Koster, Arie M.C.A. A1 - Raack, Christian A1 - Wessäly, Roland T1 - Two-layer Network Design by Branch-and-Cut featuring MIP-based Heuristics T2 - Proceedings of the INOC 2007, Spa, Belgium, also ZIB Report ZR-06-47 Y1 - 2007 UR - http://www.zib.de/Publications/abstracts/ZR-06-47 PB - International Network Optimization Conference CY - Spa, Belgium ER - TY - CHAP A1 - Raack, Christian A1 - Koster, Arie M.C.A. A1 - Orlowski, Sebastian A1 - Wessäly, Roland T1 - Capacitated network design using general flow-cutset inequalities T2 - Proceedings of the INOC 2007, Spa, Belgium, also ZIB Report ZR-07-14 Y1 - 2007 UR - http://www.zib.de/Publications/abstracts/ZR-07-14 PB - International Network Optimization Conference CY - Spa, Belgium ER - TY - CHAP A1 - Bley, Andreas A1 - Menne, Ulrich A1 - Klähne, Roman A1 - Raack, Christian A1 - Wessäly, Roland T1 - Multi-layer network design – A model-based optimization approach T2 - Proceedings of the PGTS 2008, Berlin, Germany Y1 - 2008 SP - 107 EP - 116 PB - Polish-German Teletraffic Symposium CY - Berlin, Germany ER - TY - GEN A1 - Orlowski, Sebastian A1 - Pioro, Michal A1 - Tomaszewski, Artur A1 - Wessäly, Roland T1 - SNDlib 1.0--Survivable Network Design Library N2 - We provide information on the Survivable Network Design Library (SNDlib), a data library for fixed telecommunication network design that can be accessed at http://sndlib.zib.de. In version 1.0, the library contains data related to 22 networks which, combined with a set of selected planning parameters, leads to 830 network planning problem instances. In this paper, we provide a mathematical model for each planning problem considered in the library and describe the data concepts of the SNDlib. Furthermore, we provide statistical information and details about the origin of the data sets. T3 - ZIB-Report - 07-15 KW - telecommunication network design KW - data library KW - optimization Y1 - 2007 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-9582 ER - TY - GEN A1 - Orlowski, Sebastian A1 - Werner, Axel A1 - Wessäly, Roland T1 - Estimating trenching costs in FTTx network planning N2 - In this paper we assess to which extent trenching costs of an FTTx network are unavoidable, even if technical side constraints are neglected. For that purpose we present an extended Steiner tree model. Using a variety of realistic problem instances we demonstrate that the total trenching cost can only be reduced by about 5 percent in realistic scenarios. This work has been funded by BMBF (German Federal Ministry of Education and Research) within the program "KMU-innovativ". T3 - ZIB-Report - 11-49 KW - Optical access networks KW - Optimization KW - Steiner trees Y1 - 2012 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-14884 SN - 1438-0064 ER - TY - CHAP A1 - Bentz, Winfried A1 - Eckel, Klaus A1 - Louchet, Hadrien A1 - Orlowski, Sebastian A1 - Patzak, Erwin A1 - Seibel, Julia A1 - Werner, Axel A1 - Wessäly, Roland T1 - Schätze heben bei der Planung von FTTx-Netzen T2 - Breitbandversorgung in Deutschland Y1 - 2011 VL - 227 PB - VDE-Verlag ER - TY - CHAP A1 - Orlowski, Sebastian A1 - Werner, Axel A1 - Wessäly, Roland ED - Klatte, Diethart ED - Lüthi, Hans-Jakob ED - Schmedders, Karl T1 - Estimating trenching costs in FTTx network planning T2 - Operations Research Proceedings 2011 Y1 - 2012 SP - 89 EP - 94 PB - Springer Verlag ER - TY - CHAP A1 - Bentz, Winfried A1 - Martens, Maren A1 - Orlowski, Sebastian A1 - Werner, Axel A1 - Wessäly, Roland T1 - FTTx-PLAN T2 - Breitbandversorgung in Deutschland Y1 - 2010 VL - 220 PB - VDE-Verlag ER - TY - THES A1 - Wessäly, Roland T1 - Dimensioning Survivable Capacitated Networks N2 - In der vorliegenden Dissertation untersuchen wir die Optimierung von ausfallsicheren Telekommunikationsnetzwerken. Wir präsentieren unterschiedliche gemischt-ganzzahlige Modelle für die diskrete Kapazitätsttruktu,, sowie für die Sicherung des Netzes gegen den Ausfall einzelner Komponenten. Die Modelle wurden in einer Kooperation mit der E-Plus Mobilfunk GmbH verwendet. Die theoretischen Resultate wurden in Algorithmen umgesetzt und in das von uns entiickllte Netzwerksoptimierungswerkzeug Discnet (Dimensioning Survivable Capaiitated NETworks) integriert, welches seit mehreren Jahren in der Planung bei E-Plus eingesetzt wird. Wir betrachten das Transportnetzllanungsproblem eines Telekommunikationsanbieters. Dieses Problem setzt auf logischen Kommunikattonsanforerrungen zwischen den Standorten (Knoten) des zu planenden Netzes und potentiell inslallirrbaren Verbindungen (Kanten) zwischen derselben Knotenmenge auf. Ein Kapazitätsmodell stellt die Information bereit, welche Kapazitäten auf den potentiellen Kanten verfügbar sind. Wir betrachten zwei Modelle. Entweder ist eine explizite Liste der verfügbaren Kapazittten gegeben oder eine Menge von sogenannten Basiskapazitäten, die auf jeder Kante indiviuelll kombiniert werden können. Die Basiskapazitäten müßen paarweise ganzzahlige Vielfache voneinander sein. Man beachte, daß diese Eigenschaft von den internationalen Standards PDH und SDH erfüllt wiid. Ein Ausfallsicherheitsmodell stellt die Information bereit, wie das zu planende Netz gegen den Ausfall einzelner Netzkomponenten geschützt werden soll. Wir betrachten sinnvolle Kombinationen der Modelle Diversification, Reservation und Path Restoration. Das erste Modell garantiert Ausfallsicherheit durch kommunikationsbedarfsabhängige Beschränkung des Prozentsatzes, der durch einzelne Netzkomponenten geroutet werden darf. Bei den beiden anderen Modelle können Kommunikationsbedarfe bei Ausfall einer Netzkomponente auf unterschiedliche Weise neu geroutet werden. Ziel der Planung ist eine ktstenminimlle Kapatitätsentscheidung, die eine Routenllanung aller Kommunikationsbedarfe gemäß den Ausfallsicherheitsanforderungen ermöglicht. Wir entwickeln ein Schnittebenenverfahren zur Lösung der betrachteten Optimiergngsrrobleme. Zu diesem Zweck untersuchen wir Polyeder, die mit den verschiedenen Problemen assoziiert sind. Wir präsentieren neue Klassen von Ungleichungen, entwickeln Separationsalgorithmen und Heuristiken. Mit dem Schnittebenenverfahren werden untere und obere Schranken für den Wert von Oitimallösungen berechnet, und daher ist es möglich, Qualitätsgarantien für die berechneten Löungen anzugeben. Parallel zur Beschreibung der implementierten Algorithmen präsentieren wir umfangreiche Tests mit praktisch relevanten Daten, die zu Problemen mit mehr als 2 Billionen Variablen führen. KW - Ausfallsichere Telekommunikationsnetzwerke KW - Schnittebenenverfahren Y1 - 2000 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-10158 ER - TY - GEN A1 - Menne, Ulrich A1 - Raack, Christian A1 - Wessäly, Roland A1 - Kharitonov, Daniel T1 - Optimal Degree of Optical Circuit Switching in IP-over-WDM Networks N2 - In this paper, we study the influence of technology, traffic properties and price trends on optimized design of a reference IP-over-WDM network with rich underlying fiber topology. In each network node, we investigate the optimal degree of traffic switching in an optical (lambda) domain versus an electrical (packet) domain, also known as measure of \emph{node transparency}. This measure is studied in connection to changes in traffic volume, demand affinity, optical circuit speeds and equipment cost. By applying variable design constraints, we assess the relative roles of the two distinct equipment groups, IP routers and optical cross-connects, with respect to resulting changes in cost-sensitive network architectures. T3 - ZIB-Report - 11-50 KW - IP-over-WDM KW - Circuit Switching KW - Opacity Y1 - 2012 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-14843 SN - 1438-0064 ER - TY - GEN A1 - Wessäly, Roland A1 - Werner, Axel A1 - Eckel, Klaus A1 - Seibel, Julia A1 - Orlowski, Sebastian A1 - Louchet, Hadrien A1 - Patzak, Erwin A1 - Bentz, Winfried T1 - Schätze heben bei der Planung von FTTx-Netzen: optimierte Nutzung von existierenden Leerrohren - eine Praxisstudie N2 - Das vom BMBF geförderte Projekt FTTX-PLAN entwickelt mathematische Modelle und Optimierungsverfahren, um automatisiert kostenoptimierte FTTx-Netze berechnen zu können. Wir zeigen anhand einer Praxisstudie in Zusammenarbeit mit der Regensburger R-KOM, wie ein Planer von diesen Verfahren profitieren kann, um die Auswirkungen bestimmter Entscheidungen auf die Netzstruktur und -kosten zu untersuchen. Wir illustrieren dies am Beispiel eines FTTB/FTTH-Vergleichs, der Variation von Kundenanbindungsraten und der gezielten Ausnutzung existierender Leerrohre, um Tiefbau zu vermeiden. T3 - ZIB-Report - 11-47 KW - Praxisstudie KW - Optische Zugangsnetze KW - Optimierung Y1 - 2012 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-14861 UR - http://www.vde-verlag.de/buecher/453339/breitbandversorgung-in-deutschland-itg-fb-227.html SN - 1438-0064 ER -