Skip to Main content Skip to Navigation

Optimisation de réseaux de télécommunications avec sécurisation

Abstract : The first part of this thesis, is concerned with the study of the robustness of the predictor corrector interior point algorithm and with a decomposition approach of this method for solving multicommodity network-flow problems. In the second part, we are concerned with the Global Survivability in Telecommunication Networks (PSG). 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 base 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 fractionated. So PSG can be formulated as a large-scale linear program. Its special structure favours the use of decomposition algorithms. We propose four methods using columns generation technics. The first tow are based on proximal decomposition methods. The main task of these algorithm consist in solving independent quadratic subproblems. The third algorithm is inspired by the interior point decomposition approach described in the first part. Finally, we incorporate path elimination procedure into an adaptation of ready-to-use interior points code. We report some numerical results obtained by testing these algorithms with data from the France-Telecom Paris district transmission network.
Document type :
Complete list of metadatas
Contributor : Raja Rebai <>
Submitted on : Monday, October 31, 2005 - 2:27:02 PM
Last modification on : Friday, May 25, 2018 - 12:02:05 PM
Long-term archiving on: : Friday, September 14, 2012 - 3:20:30 PM


  • HAL Id : tel-00010841, version 1



Raja Rebai. Optimisation de réseaux de télécommunications avec sécurisation. Mathématiques [math]. Université Paris Dauphine - Paris IX, 2000. Français. ⟨tel-00010841⟩



Record views


Files downloads