Different approaches for deploying resilient optical networks of low cost constitute a traditional group of NP-Hard problems that have been widely studied. Most of them are based on the construction of low cost networks that fulfill connectivity constraints. However, recent trends to virtualize optical networks over the legacy fiber infrastructure, modified the nature of network design problems and turned inappropriate many of these models and algorithms. In this paper we study a design problem arising from the deployment of an IP/MPLS network over an existing DWDM infrastructure. Besides cost and resiliency, this problem integrates traffic and capacity constraints. We present: an integer programming formulation for the problem, theoretical results, and describe how several metaheuristics were applied in order to find good quality solutions, for a real application case of a telecommunications company.
[1]
Arie M. C. A. Koster,et al.
Single-Layer Cuts for Multi-Layer Network Design Problems
,
2008
.
[2]
Geiza Maria Hamazaki da Silva,et al.
Proposta e avaliação de heurísticas grasp para o problema da diversidade máxima
,
2006
.
[3]
Stephan Mertens.
The Easiest Hard Problem: Number Partitioning
,
2006,
Computational Complexity and Statistical Physics.
[4]
Brian Hayes,et al.
The Easiest Hard Problem
,
2002,
American Scientist.
[5]
Franklina Maria Bragion de Toledo,et al.
Heuristics for minimizing the maximum within-clusters distance
,
2012
.
[6]
Haruko Okamura,et al.
Multicommodity flows in planar graphs
,
1981,
J. Comb. Theory, Ser. B.
[7]
Hervé Kerivin,et al.
Design of Survivable Networks: A survey
,
2005
.