Robust routing optimization in resilient networks : Polyhedral model and complexity issues

Abstract : In the thesis robust routing design problems in resilient networks are considered. In the first part computational complexity of such problems are discussed. The following cases are considered: - path protection and path restoration - failure-dependent and failure-independent restoration - cases with and without stub-release - single-link failures and multiple-link failures (shared risk link group) - non-bifurcated (unsplittable) flows and bifurcated flows For each of the related optimization cases a mixed-integer (in the non-bifurcated cases) or linear programming formulation (in all bifurcated cases) is presented, and their computational complexity is investigated. For the NP-hard cases original NP-hardness proofs are provided, while for the polynomial cases compact linear programming formulations (which prove the polynomiality in the question) are discussed. Moreover, pricing problems related to each of the considered NP-hard problems are discussed. The second part of the thesis deals with various routing strategies in networks where the uncertainty issues are modeled using the polyhedral model. In such networks two extrema are possible. The simplest in terms of implementation, and simultaneously the least effective strategy, is the robust stable routing. On the other hand, the most effective strategy, i.e., the dynamic routing, is virtually impossible to implement in real world networks. Therefore, the major aim of this part of the thesis is to present novel routing strategies that merge the simplicity of the robust stable routing with the efficiency of the dynamic routing
Complete list of metadatas

Cited literature [73 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00997659
Contributor : Abes Star <>
Submitted on : Wednesday, May 28, 2014 - 2:57:33 PM
Last modification on : Monday, June 17, 2019 - 5:08:09 PM
Long-term archiving on : Thursday, August 28, 2014 - 12:36:32 PM

File

ThA_se_-_-_-_ZOTKIEWICZ_-_ok_....
Version validated by the jury (STAR)

Identifiers

  • HAL Id : tel-00997659, version 1

Citation

Mateusz Zotkiewicz. Robust routing optimization in resilient networks : Polyhedral model and complexity issues. Other [cs.OH]. Institut National des Télécommunications, 2011. English. ⟨NNT : 2011TELE0001⟩. ⟨tel-00997659⟩

Share

Metrics

Record views

405

Files downloads

311