For ensuring network survivability in case of single component failures many routing protocols provide a primary and a back up routing path for each origin destination pair. We address the problem of selecting these paths such that in the event of multiple failures, occuring with given probabilities, the total loss in routable demand due to both paths being intersected is small with high probability. We present a chance constraint model and solution approaches based on an explicit integer programming formulation, a robust formulation and a cutting plane approach that yield reasonably good solutions assuming that the failures are caused by at most two elementary events, which may each affect several network components.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa.de:bsz:ch1-qucosa-175454 |
| Date | 03 August 2015 |
| Creators | Helmberg, Christoph, Richter, Sebastian, Schupke, Dominic |
| Contributors | TU Chemnitz, Fakultät für Mathematik |
| Publisher | Universitätsbibliothek Chemnitz |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:preprint |
| Format | application/pdf, text/plain, application/zip |
| Relation | dcterms:isPartOf:Preprintreihe der Fakultät für Mathematik der TU Chemnitz, Preprint 2015-09 |
Page generated in 0.0024 seconds