TY - GEN A1 - Werner, Axel A1 - Aurzada, Frank A1 - Bley, Andreas A1 - Eisenblätter, Andreas A1 - Geerdes, Hans-Florian A1 - Guillemard, Mijail A1 - Kutyniok, Gitta A1 - Philipp, Friedrich A1 - Raack, Christian A1 - Scheutzow, Michael ED - Deuflhard, Peter ED - Grötschel, Martin ED - Hömberg, Dietmar ED - Horst, Ulrich ED - Kramer, Jürg ED - Mehrmann, Volker ED - Polthier, Konrad ED - Schmidt, Frank ED - Schütte, Christof ED - Skutella, Martin ED - Sprekels, Jürgen T1 - Mathematics for telecommunications T2 - MATHEON - Mathematics for Key Technologies Y1 - 2014 U6 - https://doi.org/10.4171/137 VL - 1 SP - 75 EP - 89 PB - European Mathematical Society ET - EMS Series in Industrial and Applied Mathematics ER - TY - JOUR A1 - Heinze, Rieke A1 - Dipankar, Anurag A1 - Henken, Cintia Carbajal A1 - Moseley, Christopher A1 - Sourdeval, Odran A1 - Trömel, Silke A1 - Xie, Xinxin A1 - Adamidis, Panos A1 - Ament, Felix A1 - Baars, Holger A1 - Barthlott, Christian A1 - Behrendt, Andreas A1 - Blahak, Ulrich A1 - Bley, Sebastian A1 - Brdar, Slavko A1 - Brueck, Matthias A1 - Crewell, Susanne A1 - Deneke, Hartwig A1 - Di Girolamo, Paolo A1 - Evaristo, Raquel A1 - Fischer, Jürgen A1 - Frank, Christopher A1 - Friederichs, Petra A1 - Göcke, Tobias A1 - Gorges, Ksenia A1 - Hande, Luke A1 - Hanke, Moritz A1 - Hansen, Akio A1 - Hege, Hans-Christian A1 - Hose, Corinna A1 - Jahns, Thomas A1 - Kalthoff, Norbert A1 - Klocke, Daniel A1 - Kneifel, Stefan A1 - Knippertz, Peter A1 - Kuhn, Alexander A1 - van Laar, Thriza A1 - Macke, Andreas A1 - Maurer, Vera A1 - Mayer, Bernhard A1 - Meyer, Catrin I. A1 - Muppa, Shravan K. A1 - Neggers, Roeland A. J. A1 - Orlandi, Emiliano A1 - Pantillon, Florian A1 - Pospichal, Bernhard A1 - Röber, Niklas A1 - Scheck, Leonhard A1 - Seifert, Axel A1 - Seifert, Patric A1 - Senf, Fabian A1 - Siligam, Pavan A1 - Simmer, Clemens A1 - Steinke, Sandra A1 - Stevens, Bjorn A1 - Wapler, Kathrin A1 - Weniger, Michael A1 - Wulfmeyer, Volker A1 - Zängl, Günther A1 - Zhang, Dan A1 - Quaas, Johannes T1 - Large-eddy simulations over Germany using ICON: a comprehensive evaluation JF - Quarterly Journal of the Royal Meteorological Society N2 - Large-eddy simulations (LES) with the new ICOsahedral Non-hydrostatic atmosphere model (ICON) covering Germany are evaluated for four days in spring 2013 using observational data from various sources. Reference simulations with the established Consortium for Small-scale Modelling (COSMO) numerical weather prediction model and further standard LES codes are performed and used as a reference. This comprehensive evaluation approach covers multiple parameters and scales, focusing on boundary-layer variables, clouds and precipitation. The evaluation points to the need to work on parametrizations influencing the surface energy balance, and possibly on ice cloud microphysics. The central purpose for the development and application of ICON in the LES configuration is the use of simulation results to improve the understanding of moist processes, as well as their parametrization in climate models. The evaluation thus aims at building confidence in the model's ability to simulate small- to mesoscale variability in turbulence, clouds and precipitation. The results are encouraging: the high-resolution model matches the observed variability much better at small- to mesoscales than the coarser resolved reference model. In its highest grid resolution, the simulated turbulence profiles are realistic and column water vapour matches the observed temporal variability at short time-scales. Despite being somewhat too large and too frequent, small cumulus clouds are well represented in comparison with satellite data, as is the shape of the cloud size spectrum. Variability of cloud water matches the satellite observations much better in ICON than in the reference model. In this sense, it is concluded that the model is fit for the purpose of using its output for parametrization development, despite the potential to improve further some important aspects of processes that are also parametrized in the high-resolution model. Y1 - 2017 U6 - https://doi.org/10.1002/qj.2947 VL - 143 IS - 702 SP - 69 EP - 100 ER - TY - GEN A1 - Bley, Andreas A1 - Koch, Thorsten T1 - Optimierung in der Planung und beim Aufbau des G-WiN N2 - Ende Juni diesen Jahres wurde das Gigabit-Wissenschaftsnetz offiziell gestartet. In der zweijährigen Vorbereitungsphase wurden nicht nur die technischen Möglichkeiten der neuen Übertragungstechniken und Dienste getestet. Es wurden auch verschiedene Fragestellungen zum effizienten Einsatz der verfügbaren Ressourcen für den Betrieb des G-WiN untersucht. In diesem Artikel beschreiben wir, wie das G-WiN zu seiner jetzigen Struktur und Topologie gekommen ist. T3 - ZIB-Report - 00-48 Y1 - 2000 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-6169 ER - TY - GEN A1 - Bley, Andreas A1 - Koch, Thorsten T1 - Integer programming approaches to access and backbone IP-network planning N2 - In this article we study the problem of designing a nation-wide communication network. Such networks usually consist of an access layer, a backbone layer, and maybe several intermediate layers. The nodes of each layer must be connected to those of the next layer in a tree-like fashion. The backbone layer has to satisfy certain survivability and routing constraints. Given the node locations, the demands between them, the possible connections and hardware configurations, and various other technical and administrational constraints, the goal is to decide, which node is assigned to which network level, how the nodes are connected, what hardware must be installed, and how traffic is routed in the backbone. Mixed integer linear programming models and solution methods are presented for both the access and the backbone network design problem. The focus is on the design of IP-over-SDH networks, but the access network design model and large parts of the backbone network design models are general and also applicable for other types of communication networks. Results obtained with these methods in the planning of the German research network are presented. T3 - ZIB-Report - 02-41 KW - Network design KW - Traffic enineering KW - Internet routing KW - Mixed-integer programming Y1 - 2002 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7081 ER - TY - GEN A1 - Bley, Andreas T1 - Inapproximability Results for the Inverse Shortest Paths Problem with Integer Length and Unique Shortest Paths N2 - We study the complexity of two Inverse Shortest Paths (ISP) problems with integer arc lengths and the requirement for uniquely determined shortest paths. Given a collection of paths in a directed graph, the task is to find positive integer arc lengths such that the given paths are uniquely determined shortest paths between their respective terminals. The first problem seeks for arc lengths that minimize the length of the longest of the prescribed paths. In the second problem, the length of the longest arc is to be minimized. We show that it is $np-hard$ to approximate the minimal longest path length within a factor less than $8/7$ or the minimal longest arc length within a factor less than $9/8$. This answers the (previously) open question whether these problems are $np-hard$ or not. We also present a simple algorithm that achieves an $\mathcal{O}(|V|)$-approximation guarantee for both variants. Both ISP problems arise in the planning of telecommunication networks with shortest path routing protocols. Our results imply that it is $\mathcal{NP}$-hard to decide whether a given path set can be realized with a real shortest path routing protocol such as OSPF, IS-IS, or RIP. T3 - ZIB-Report - 05-04 KW - Inverse Shortest Paths KW - Computational Complexity KW - Approximation KW - Shortest Path Routing Y1 - 2005 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8388 ER - TY - GEN A1 - Bley, Andreas A1 - Koch, Thorsten A1 - Niu, Lingfeng T1 - Experiments with nonlinear extensions to SCIP N2 - This paper describes several experiments to explore the options for solving a class of mixed integer nonlinear programming problems that stem from a real-world mine production planning project. The only type of nonlinear constraints in these problems are bilinear equalities involving continuous variables, which enforce the ratios between elements in mixed material streams. A branch-and-bound algorithm to handle the integer variables has been tried in another project. However, this branch-and-bound algorithm is not effective for handling the nonlinear constraints. Therefore state-of-the-art nonlinear solvers are utilized to solve the resulting nonlinear subproblems in this work. The experiments were carried out using the NEOS server for optimization. After finding that current nonlinear programming solvers seem to lack suitable preprocessing capabilities, we preprocess the instances beforehand and use an heuristic approach to solve the nonlinear subproblems. In the appendix, we explain how to add a polynomial constraint handler that uses IPOPT as embedded nonlinear programming solver for the constraint programming framework SCIP. This is one of the crucial steps for implementing our algorithm in SCIP. We briefly described our approach and give an idea of the work involved. T3 - ZIB-Report - 08-28 Y1 - 2008 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8300 SN - 1438-0064 ER - TY - GEN A1 - Bley, Andreas A1 - Pattloch, Marcus T1 - Modellierung und Optimierung der X-WiN Plattform N2 - In diesem Artikel werden die Optimierungsmodelle und -verfahren beschrieben, die bei der Planung des Kernnetzes und der Zugangsinfrastruktur des X-WiN verwendet wurden. T3 - ZIB-Report - 05-21 Y1 - 2005 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-8551 ER - TY - GEN A1 - Bley, Andreas T1 - A Lagrangian Approach for Integrated Network Design and Routing in IP Networks N2 - We consider the problem of designing a network that employs a non-bifurcated shortest path routing protocol. The network's nodes and the set of potential links are given together with a set of forecasted end-to-end traffic demands. All relevant hardware components installable at links or nodes are considered. The goal is to simultaneously choose the network's topology, to decide which hardware components to install on which links and nodes, and to find appropriate routing weights such that the overall network cost is minimized. In this paper, we present a mathematical optimization model for this problem and an algorithmic solution approach based on a Lagrangian relaxation. Computational results achieved with this approach for several real-world network planning problems are reported. T3 - ZIB-Report - 03-29 KW - Network Planning KW - Routing KW - IP Routing KW - Lagrangian relaxation Y1 - 2003 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7515 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 - Bley, Andreas A1 - Zymolka, Adrian T1 - Planung kostenoptimaler Informations- und Kommunikations-Infrastrukturen N2 - Beim Entwurf und Ausbau von Informations- und Kommunikationsnetzwerken m{ü}ssen zahlreiche interdependente Entscheidungen getroffen und gleichzeitig mannigfaltige Bedingungen ber{ü}cksichtigt werden. Die verf{ü}gbaren technischen und organisatorischen Alternativm{ö}glichkeiten sind normalerweise so vielf{ä}ltig und komplex, dass eine manuelle Planung praktisch nicht m{ö}glich ist. In diesem Artikel wird das Potential und die Methodik der mathematischen Optimierung bei der kostenoptimalen Planung von Kommunikationsnetzen vorgestellt. Als Ausgangspunkt wird exemplarisch eine typische praktische Aufgabe, die Struktur- und Konfigurationsplanung mehrstufiger Telekommunikationsnetzwerke, dargestellt. Anschließend werden kurz die wesentlichen Modellierungstechniken und Verfahrensans{ä}tze der mathematischen Optimierung skizziert. Abschließend gehen wir auf die Planung einer ad{ä}quaten Informations- und Kommunikations- Infrastruktur f{ü}r ein dezentrales Energieversorgungsnetz ein. T3 - ZIB-Report - 03-37 Y1 - 2003 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7591 ER -