https:/
https:/Title
Proximal Decomposition Method for solving Global Survivability in Telecommunication Network
Description
Projet MOCOA
In this paper, we are concerned with the global survivability in telecommunica- tion networks. The objective consists in finding the optimal routing and the least cost investment in base and reserve capacities. The routing and the base capacity insure nominal traffic and the reserve capacity guarantees survivability of the traffic against any arc failure (using a global rerouting strategy). In our model we consider that routings and capacities can be fractional. So the Global Survivability Problem (GSP) can be formulated as a large-scale linear program. Its special structure favours the use of decomposition algorithms. We propose a method using columns generation and proximal decomposition techniques. The main task of this algorithm consists in solving independent quadratic subproblems. We report some numerical results obtained by testing these algorithms with data from the France-Telecom Paris district transmission network.
Publisher
Date of Appearance
Submission Date
Language
Subject
MULTICOMMODITY NETWORK FLOW MODELS; LARGE-SCALE LINEAR PROGRAMMING; DECOMPOSITION; PROXIMAL METHODS; NETWORK SURVIVABILITY; [INFO.INFO-OH]Computer Science [cs]/Other [cs.OH]; [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]
Repository URL
Set Name
Reports; Computer Science [cs]; Mathematics [math]; INRIA - Institut National de Recherche en Informatique et en Automatique; Rapports de recherche et Technique de l'Inria; CNRS-INSMI - INstitut des Sciences Mathématiques et de leurs Interactions; Réseau de recherche en Théorie des Systèmes Distribués, Modélisation, Analyse et Contrôle des Systèmes; LARA
Mobile Tag