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) In [Host publication title missing] p.2228 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) overdimensioned normal pathflows (i.e., pathflows... (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) overdimensioned normal pathflows (i.e., pathflows defined for the availability state with all links fully available, the so called normal state) that are thinned in a failure statedependent 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 noncompact 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 flowthinning routing with other routing strategies studied before. In the presented version, our model is applicable to wireless networks with noninterfering pointtopoint links such as freespace optical links or microwave links. (Less)
Please use this url to cite or link to this publication:
http://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 mixedinteger programming, multicommodity flow networks, path, generation
 in
 [Host publication title missing]
 pages
 22  28
 publisher
 IEEEInstitute of Electrical and Electronics Engineers Inc.
 conference name
 8th IEEE International Conference on Broadband, Wireless Computing, Communication and Applications (BWCCA)
 external identifiers

 WOS:000331174400004
 Scopus:84893256558
 DOI
 10.1109/BWCCA.2013.13
 language
 English
 LU publication?
 yes
 id
 873b735c4c8247e380a43d957cb56094 (old id 4376596)
 date added to LUP
 20140414 09:46:37
 date last changed
 20161013 04:43:54
@misc{873b735c4c8247e380a43d957cb56094, 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) overdimensioned normal pathflows (i.e., pathflows defined for the availability state with all links fully available, the so called normal state) that are thinned in a failure statedependent 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 noncompact 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 flowthinning routing with other routing strategies studied before. In the presented version, our model is applicable to wireless networks with noninterfering pointtopoint links such as freespace optical links or microwave links.}, author = {Pioro, Michal and Nace, Dritan and Fouquet, Yoann}, keyword = {survivable network design,wireless networks,protection routing,linear,and mixedinteger programming,multicommodity flow networks,path,generation}, language = {eng}, pages = {2228}, publisher = {ARRAY(0x7900a10)}, series = {[Host publication title missing]}, title = {On protected traffic routing in wireless networks with partial multiple link failures}, url = {http://dx.doi.org/10.1109/BWCCA.2013.13}, year = {2013}, }