On protected traffic routing in wireless networks with partial multiple link failures
(2013) 8th IEEE International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA) p.22-28- Abstract
- In this paper we study an optimization problem relevant for wireless networks. In such networks links are subject to capacity disruptions caused by changing weather/channel condition that force to adapt the modulation and coding schemes to the observed condition. To cope with this issue in network optimization, we need to consider a so called link availability set A and a routing strategy that can adapt to each state of link capacities corresponding to each point of A. We assume that A is finite and each alpha is an element of A specifies, for each link e is an element of epsilon fraction alpha(e) of its maximum capacity available in state a. For traffic protection we assume (possibly) over-dimensioned normal path-flows (i.e., path-flows... (More)
- In this paper we study an optimization problem relevant for wireless networks. In such networks links are subject to capacity disruptions caused by changing weather/channel condition that force to adapt the modulation and coding schemes to the observed condition. To cope with this issue in network optimization, we need to consider a so called link availability set A and a routing strategy that can adapt to each state of link capacities corresponding to each point of A. We assume that A is finite and each alpha is an element of A specifies, for each link e is an element of epsilon fraction alpha(e) of its maximum capacity available in state a. For traffic protection we assume (possibly) over-dimensioned normal path-flows (i.e., path-flows defined for the availability state with all links fully available, the so called normal state) that are thinned in a failure state-dependent way to adapt to fluctuating reduced capacity. What is important, the normal flows cannot be increased or restored in any way. Moreover, we assume that the demand volumes to be realized in states alpha can be reduced as compared to the normal demands. To solve a link cost minimization problem corresponding to the above assumptions, we develop an original non-compact linear programming model together with its solution algorithm based on path generation. We also present a numerical study that illustrates the efficiency of the introduced model and compare the performance of the assumed flow-thinning routing with other routing strategies studied before. In the presented version, our model is applicable to wireless networks with non-interfering point-to-point links such as free-space optical links or microwave links. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/4376596
- author
- Pioro, Michal LU ; Nace, Dritan and Fouquet, Yoann
- organization
- publishing date
- 2013
- type
- Chapter in Book/Report/Conference proceeding
- publication status
- published
- subject
- keywords
- survivable network design, wireless networks, protection routing, linear, and mixed-integer programming, multicommodity flow networks, path, generation
- host publication
- [Host publication title missing]
- pages
- 22 - 28
- publisher
- IEEE - Institute of Electrical and Electronics Engineers Inc.
- conference name
- 8th IEEE International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA)
- conference dates
- 2013-10-28 - 2013-10-30
- external identifiers
-
- wos:000331174400004
- scopus:84893256558
- DOI
- 10.1109/BWCCA.2013.13
- language
- English
- LU publication?
- yes
- id
- 873b735c-4c82-47e3-80a4-3d957cb56094 (old id 4376596)
- date added to LUP
- 2016-04-04 11:05:37
- date last changed
- 2022-01-29 21:20:10
@inproceedings{873b735c-4c82-47e3-80a4-3d957cb56094,
abstract = {{In this paper we study an optimization problem relevant for wireless networks. In such networks links are subject to capacity disruptions caused by changing weather/channel condition that force to adapt the modulation and coding schemes to the observed condition. To cope with this issue in network optimization, we need to consider a so called link availability set A and a routing strategy that can adapt to each state of link capacities corresponding to each point of A. We assume that A is finite and each alpha is an element of A specifies, for each link e is an element of epsilon fraction alpha(e) of its maximum capacity available in state a. For traffic protection we assume (possibly) over-dimensioned normal path-flows (i.e., path-flows defined for the availability state with all links fully available, the so called normal state) that are thinned in a failure state-dependent way to adapt to fluctuating reduced capacity. What is important, the normal flows cannot be increased or restored in any way. Moreover, we assume that the demand volumes to be realized in states alpha can be reduced as compared to the normal demands. To solve a link cost minimization problem corresponding to the above assumptions, we develop an original non-compact linear programming model together with its solution algorithm based on path generation. We also present a numerical study that illustrates the efficiency of the introduced model and compare the performance of the assumed flow-thinning routing with other routing strategies studied before. In the presented version, our model is applicable to wireless networks with non-interfering point-to-point links such as free-space optical links or microwave links.}},
author = {{Pioro, Michal and Nace, Dritan and Fouquet, Yoann}},
booktitle = {{[Host publication title missing]}},
keywords = {{survivable network design; wireless networks; protection routing; linear; and mixed-integer programming; multicommodity flow networks; path; generation}},
language = {{eng}},
pages = {{22--28}},
publisher = {{IEEE - Institute of Electrical and Electronics Engineers Inc.}},
title = {{On protected traffic routing in wireless networks with partial multiple link failures}},
url = {{http://dx.doi.org/10.1109/BWCCA.2013.13}},
doi = {{10.1109/BWCCA.2013.13}},
year = {{2013}},
}