An optimization model for communication networks resilient to partial multiple link failures
(2014) 2014 INFORMS Telecommunications Conference- Abstract
- This submission is devoted to optimization of networks that permanently experience fluctuations
of the capacity available on their links. This is an important and novel topic since limited link availability is a fundamental feature in wireless networks and yet majority of
work in survivable network design is restricted to the total single link failures. We assume
a given finite set of network states. Each state is characterized by availability coefficients
specifying, for each link, the fraction of its reference capacity available in this state, and
by traffic coefficients specifying, for each demand, the proportion of its reference traffic to
be realized in the considered state. Our... (More) - This submission is devoted to optimization of networks that permanently experience fluctuations
of the capacity available on their links. This is an important and novel topic since limited link availability is a fundamental feature in wireless networks and yet majority of
work in survivable network design is restricted to the total single link failures. We assume
a given finite set of network states. Each state is characterized by availability coefficients
specifying, for each link, the fraction of its reference capacity available in this state, and
by traffic coefficients specifying, for each demand, the proportion of its reference traffic to
be realized in the considered state. Our routing strategy allows for thinning/thickening the
reference path-flows, with the thickening limited by a given upper bound U of the reference
value. Thus, in each state, the value of every path-flow can range from 0 to U times its
reference value. For the corresponding link cost minimization problem (where link capacities
and state-dependent path-flows are decision variables) we present a non-compact linear programming
model together with a solution algorithm based on path generation. We illustrate
the effectiveness of the introduced routing strategy by presenting numerical results for a set
of representative network examples. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/5337456
- author
- Fouquet, Yoann ; Pioro, Michal LU ; Nace, Dritan ; Poss, Michael and Zotkiewicz, Mateusz
- organization
- publishing date
- 2014
- type
- Contribution to conference
- publication status
- published
- subject
- keywords
- survivable networks, partial multiple failures, path generation
- conference name
- 2014 INFORMS Telecommunications Conference
- conference location
- Lisbon, Portugal
- conference dates
- 2014-03-02 - 2014-03-04
- language
- English
- LU publication?
- yes
- id
- 890d5050-a43b-4fda-8b82-659a707c6721 (old id 5337456)
- date added to LUP
- 2016-04-04 14:15:34
- date last changed
- 2018-11-21 21:19:14
@misc{890d5050-a43b-4fda-8b82-659a707c6721,
abstract = {{This submission is devoted to optimization of networks that permanently experience fluctuations<br/><br>
of the capacity available on their links. This is an important and novel topic since limited link availability is a fundamental feature in wireless networks and yet majority of<br/><br>
work in survivable network design is restricted to the total single link failures. We assume<br/><br>
a given finite set of network states. Each state is characterized by availability coefficients<br/><br>
specifying, for each link, the fraction of its reference capacity available in this state, and<br/><br>
by traffic coefficients specifying, for each demand, the proportion of its reference traffic to<br/><br>
be realized in the considered state. Our routing strategy allows for thinning/thickening the<br/><br>
reference path-flows, with the thickening limited by a given upper bound U of the reference<br/><br>
value. Thus, in each state, the value of every path-flow can range from 0 to U times its<br/><br>
reference value. For the corresponding link cost minimization problem (where link capacities<br/><br>
and state-dependent path-flows are decision variables) we present a non-compact linear programming<br/><br>
model together with a solution algorithm based on path generation. We illustrate<br/><br>
the effectiveness of the introduced routing strategy by presenting numerical results for a set<br/><br>
of representative network examples.}},
author = {{Fouquet, Yoann and Pioro, Michal and Nace, Dritan and Poss, Michael and Zotkiewicz, Mateusz}},
keywords = {{survivable networks; partial multiple failures; path generation}},
language = {{eng}},
title = {{An optimization model for communication networks resilient to partial multiple link failures}},
year = {{2014}},
}