Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
8903396 | Electronic Notes in Discrete Mathematics | 2018 | 10 Pages |
Abstract
For a given fiber network and a given set of client demands, the transparent optical network design problem is the task of assigning routing paths and wavelengths for a set of lightpaths able to groom all client demands. We address this design problem minimizing the impact of a given set of critical nodes. The problem is tackled in two steps: first, we minimize the demand that is disrupted by the simultaneous failure of all critical nodes; second, we minimize the network design cost guaranteeing that the minimum disrupted demand is met. We present MILP models for each step, together with valid inequalities strengthening both models. For the second step, an efficient hybrid heuristic is also proposed.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Fábio Barbosa, Amaro de Sousa, Agostinho Agra,