Optimal design of an IP/MPLS over DWDM network

Abstract

ABSTRACT. 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.

Metaheuristic approaches for IP/MPLS network design

“…A more complete description of this heuristic and the properties of the FRP model can be found in Canale et al. () and Risso and Robledo ().…”

“…If the solution remains feasible the logical link under analysis is permanently removed, otherwise it is reinserted and the sequence follows to the remaining logical links. A more complete description of this heuristic and the properties of the FRP model can be found in Canale et al (2014) and Risso and Robledo (2013).…”

“…The FRP problem embeds two subproblems: (a) mapping logical links over the optical network (proven NP‐hard in Canale et al., ) and (b) finding feasible routes for paths of tunnels within the logical layer itself (proven NP‐hard in Risso and Robledo, ). Unlike the ASP flavor, the number of paths to protect a tunnel in FRP is unlimited and undetermined, and the representation would have been too complex for an EA.…”