HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Proximal Decomposition Method for solving Global Survivability in Telecommunication Network

Abstract : 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.
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 10:20:13 AM
Last modification on : Friday, February 4, 2022 - 3:19:33 AM
Long-term archiving on: : Sunday, April 4, 2010 - 11:14:16 PM


  • HAL Id : inria-00072582, version 1



J. Frederic Bonnans, Mounir Haddou, Abdel Lisser, Raja Rébaï. Proximal Decomposition Method for solving Global Survivability in Telecommunication Network. [Research Report] RR-4055, INRIA. 2000. ⟨inria-00072582⟩



Record views


Files downloads