4 research outputs found

    Fiber to the home

    Get PDF
    In den letzten Jahren gab es zunehmenden Bedarf für breitbandige Telekommunikations Netzwerke. Eine von Telekommunikationsunternehmen angewandte Strategie um die Bandbreite entlang der last-mile des Netzwerks zu erhöhen ist, Glasfaserkabel direkt bis zum Endkunden zu verlegen. Diese Strategie wird fiber to the home (FTTH) genannt. In der vorliegenden Arbeit wird das local access network design problem (LAN) und die Variante mit prize-collecting (PC-LAN) verwendet, um das Problem der FTTH Planung zu modellieren. Das LAN Problem zielt darauf ab eine kostenminimale Lösung zu finden und gestattet es sowohl verschiedene Kabeltechnologien und existierende Infrastruktur, als auch die Zusatzkosten zu modellieren, die anfallen wenn neue Verbindungen hergestellt werden. Darüber hinaus, erlaubt das PC-LAN Problem den Aspekt zu modellieren, dass nicht unbedingt alle Kunden mit FTTH versorgt werden müssen. Stattdessen wird eine Teilmenge der Kunden versorgt mit dem Ziel den Profit zu maximieren. Um LAN und PC-LAN Problem Instanzen zu lösen, werden folgende Methoden des Operations Research angewandt: Preprocessing, ganzzahlige Programmierung, Stärkung der mathematischen Modelle durch Disaggregation der Variablen, Benders' Dekomposition und adaptive Multi-Start-Heuristiken. In einem Projekt von Universität Wien und Telekom Austria wurden große FTTH Datensätze untersucht und die hier vorgestellten Methoden entworfen. Diese Lösungsansätze wurden als Computerprogramme implementiert und ihre Tauglichkeit zur Behandlung von FTTH Planungsfragen konnte gezeigt werden.Within recent years the request for broadband telecommunication networks has been constantly increasing. A strategy employed by telecommunication companies to increase the bandwidth on the last mile of the network is to lay optical fiber directly to the end customer. This strategy is denoted as fiber to the home (FTTH). In this thesis the local access network design problem (LAN) and its prize-collecting variant (PC-LAN) are used to formalize the planning of FTTH networks. The LAN problem asks for a cost minimal solution and allows to model different cable technologies, existing infrastructure and the overhead cost incurred by building new connections. In addition, the PC-LAN problem covers the aspect, that not all customers must necessarily be connected with FTTH, but instead we search for a subset of customers in order to maximize profits. To solve LAN and PC-LAN instances, the following operations research methods are employed: Preprocessing, mixed integer programming, model strengthening by variable disaggregation, Benders' decomposition and adaptive multi-start heuristics. In a project between University of Vienna and Telekom Austria, large real world data sets for FTTH planning were investigated and the methods presented in this thesis have been designed. These solution methods have been implemented as computer programs and empirically verified to be reasonable approaches to FTTH network design problems

    Bidirected and unidirected capacity installation in telecommunication networks

    Get PDF
    In the design of telecommunication networks, decisions concerning capacity installation and routing of commodities have to be taken simultaneously. Network loading problems formalize these decisions in mathematical optimization models. Several variants of the problem exist: bifurcated or non-bifurcated routing, bidirected or unidirected capacity installation, and symmetric versus non-symmetric routing restrictions. Moreover, different concepts of reliability can be considered. In this paper, we study the polyhedral structure of two basic problems for non-bifurcated routing: network loading with bidirected and unidirected capacity installation.we show that strong valid inequalities for the substructure restricted to a single edge, are also strong valid inequalities for the overall models. In a computational study, several classes of inequalities, both for the substructure and the overall problem, are compared on real-life instances for both variants of network loading
    corecore