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.
Publié le : 2000-07-05
Classification:
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]
@article{Report N°: RR-4055,
author = {Bonnans, J. Frederic and Haddou, Mounir and Lisser, Abdel and R\'eba\"\i , Raja},
title = {Proximal Decomposition Method for solving Global Survivability in Telecommunication Network},
journal = {HAL},
volume = {2000},
number = {0},
year = {2000},
language = {en},
url = {http://dml.mathdoc.fr/item/Report N°: RR-4055}
}
Bonnans, J. Frederic; Haddou, Mounir; Lisser, Abdel; Rébaï, Raja. Proximal Decomposition Method for solving Global Survivability in Telecommunication Network. HAL, Tome 2000 (2000) no. 0, . http://gdmltest.u-ga.fr/item/Report%20N%C2%B0:%20RR-4055/