TY - JOUR
T1 - Availability-driven optimal design of shared path protection in WDM networks
AU - Tarifeño-Gajardo, Marco
AU - Beghelli, Alejandra
AU - Moreno, Eduardo
N1 - Publisher Copyright:
© 2016 Wiley Periodicals, Inc.
PY - 2016/10/1
Y1 - 2016/10/1
N2 - Availability, defined as the fraction of time a network service is operative, is a key network service parameter. Dedicated protection increases availability but also the cost. Shared protection instead decreases the cost, but also the availability. In this article, we formulate and solve an integer linear programming (ILP) model for the problem of minimizing the backup resources required by a shared-protected static optical network whilst guaranteeing an availability target per connection. The main research challenge is dealing with the nonlinear expression for the availability constraint. Taking the working/backup routes and the availability requirements as input data, the ILP model identifies the set of connections sharing backup resources in any given network link. We also propose a greedy heuristic to solve large instances in much shorter time than the ILP model with low levels of relative error (2.49% average error in the instances studied) and modify the ILP model to evaluate the impact of wavelength conversion. Results show that considering availability requirements can lead up to 56.4% higher backup resource requirements than not considering them at all, highlighting the importance of availability requirements in budget estimation.
AB - Availability, defined as the fraction of time a network service is operative, is a key network service parameter. Dedicated protection increases availability but also the cost. Shared protection instead decreases the cost, but also the availability. In this article, we formulate and solve an integer linear programming (ILP) model for the problem of minimizing the backup resources required by a shared-protected static optical network whilst guaranteeing an availability target per connection. The main research challenge is dealing with the nonlinear expression for the availability constraint. Taking the working/backup routes and the availability requirements as input data, the ILP model identifies the set of connections sharing backup resources in any given network link. We also propose a greedy heuristic to solve large instances in much shorter time than the ILP model with low levels of relative error (2.49% average error in the instances studied) and modify the ILP model to evaluate the impact of wavelength conversion. Results show that considering availability requirements can lead up to 56.4% higher backup resource requirements than not considering them at all, highlighting the importance of availability requirements in budget estimation.
KW - availability-guarantees
KW - heuristic
KW - integer linear programming
KW - optical networks
KW - prioritized shared protection
KW - shared path protection
KW - wavelength division multiplexing networks
UR - http://www.scopus.com/inward/record.url?scp=84985961555&partnerID=8YFLogxK
U2 - 10.1002/net.21695
DO - 10.1002/net.21695
M3 - Article
AN - SCOPUS:84985961555
SN - 0028-3045
VL - 68
SP - 224
EP - 237
JO - Networks
JF - Networks
IS - 3
ER -