Premium
Availability‐driven optimal design of shared path protection in WDM networks
Author(s) -
TarifeñoGajardo Marco,
Beghelli Alejandra,
Moreno Eduardo
Publication year - 2016
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.21695
Subject(s) - backup , computer science , integer programming , path protection , computer network , distributed computing , heuristic , key (lock) , greedy algorithm , linear programming , constraint (computer aided design) , mathematical optimization , wavelength division multiplexing , engineering , mathematics , computer security , algorithm , wavelength , mechanical engineering , physics , optoelectronics , database , artificial intelligence
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. © 2016 Wiley Periodicals, Inc. NETWORKS, Vol. 68(3), 224–237 2016