Metaheuristic approaches for IP/MPLS network design

This work introduces metaheuristic approaches for designing resilient and cost-effective multiprotocol label switching (MPLS) networks, a technology that is gaining prominent importance since most of the global data traffic is Internet traffic, and most internet protocol (IP) traffic within service provider backbones is being supported upon the IP/MPLS technology. Our approach is innovative because it integrates an overlay network design problem with the effective usage of traffic-engineering features of this technology. Due to the resulting complexity and a high level of technological detail, we decided to use metaheuristics to find solutions to prospective scenarios for two real-world applications. The best results were achieved using evolutionary algorithms and GRASP (Greedy Randomized Adaptive Search Procedure). The relative improvements for some of these scenarios are outstanding and reveal how using the protection mechanisms provided by newer technologies may advance efficiency standards more than legacy protection schemas.

[1]  Mauricio G. C. Resende,et al.  Multiobjective GRASP with Path Relinking , 2015, Eur. J. Oper. Res..

[2]  Franco Robledo,et al.  Using GRASP for designing a layered network: a real IP/MPLS over DWDM application case , 2013, Int. J. Metaheuristics.

[3]  Franco Robledo,et al.  Optimal design of an IP/MPLS over DWDM network , 2014 .

[4]  Sergio Nesmachnow,et al.  An overview of metaheuristics: accurate and efficient methods for optimisation , 2014, Int. J. Metaheuristics.

[5]  Claudio E. Risso.  Using GRASP and GA to design resilient and cost-effective IP/MPLS networks. (Utilisation de GRASP et des Algorithmes Génétiques pour la conception de réseaux IP/MPLS résistants et à coût réduit) , 2014 .

[6]  Eytan Modiano,et al.  Lightpath routing and capacity assignment for survivable IP-over-WDM networks , 2009, 2009 7th International Workshop on Design of Reliable Communication Networks.

[7]  Enrique Alba,et al.  Parallel metaheuristics: recent advances and new trends , 2012, Int. Trans. Oper. Res..

[8]  Fred W. Glover,et al.  Greedy randomized adaptive search procedure with exterior path relinking for differential dispersion minimization , 2015, Inf. Sci..

[9]  L. Velasco,et al.  Survivable IP/MPLS-Over-WSON Multilayer Network Optimization , 2011, IEEE/OSA Journal of Optical Communications and Networking.

[10]  Martin Oellrich.  Minimum Cost Disjoint Paths under Arc Dependences. Algorithms for Practice , 2008 .

[11]  Michal Pioro,et al.  An IP/MPLS over WDM network design problem , 2005 .

[12]  Fred W. Glover,et al.  Future paths for integer programming and links to artificial intelligence , 1986, Comput. Oper. Res..

[13]  Arie M. C. A. Koster,et al.  Single-Layer Cuts for Multi-Layer Network Design Problems , 2008 .

[14]  Eduardo Alberto Canale,et al.  Optimal Edge Fault-Tolerant Bijective Embedding of a Complete Graph over a Cycle , 2015, Electron. Notes Discret. Math..

[15]  Haruko Okamura,et al.  Multicommodity flows in planar graphs , 1981, J. Comb. Theory, Ser. B.