A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem
Visualitza/Obre
A GRASP with pathrelinking heuristic for the survivable IPMPLSoverWSON multilayer network optimization problem (1,509Mb) (Accés restringit)
Sol·licita una còpia a l'autor
Què és aquest botó?
Aquest botó permet demanar una còpia d'un document restringit a l'autor. Es mostra quan:
- Disposem del correu electrònic de l'autor
- El document té una mida inferior a 20 Mb
- Es tracta d'un document d'accés restringit per decisió de l'autor o d'un document d'accés restringit per política de l'editorial
Cita com:
hdl:2117/20600
Tipus de documentArticle
Data publicació2013-12
Condicions d'accésAccés restringit per política de l'editorial
Llevat que s'hi indiqui el contrari, els
continguts d'aquesta obra estan subjectes a la llicència de Creative Commons
:
Reconeixement-NoComercial-SenseObraDerivada 3.0 Espanya
Abstract
In this paper we deal with the survivable internet protocol (IP)/multi-protocol label switching (MPLS)-over-wavelength switched optical network (WSON) multi-layer network optimization problem (SIMNO). This problem entails planning an IP/MPLS network layer over a photonic mesh infrastructure whilst, at the same time, ensuring the highest availability of services and minimizing the capital expenditures (CAPEX) investments. Such a problem is currently identified as an open issue among network operators, and hence, its solution is of great interest. To tackle SIMNO, we first provide an integer linear programming (ILP) formulation which provides an insight into the complexity of its managing. Then, a greedy randomized adaptive search procedure (GRASP) with path-relinking (PR) together with a biased random-key genetic algorithm (BRKGA) are specifically developed to help solve the problem. The performance of both heuristics is exhaustively tested and compared making use of various network and traffic instances. Numerical experiments show the benefits of using GRASP instead of BRKGA when dealing with highly complex network scenarios. Moreover, we verified that the use of GRASP with PR remarkably improves the basic GRASP algorithm, particularly in real-sized, complex scenarios such as those proposed in this paper.
CitacióPedrola, O. [et al.]. A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem. "Computers & operations research", Desembre 2013, vol. 40, núm. 12, p. 3174-3187.
ISSN0305-0548
Versió de l'editorhttp://www.sciencedirect.com/science/article/pii/S0305054811003145
Col·leccions
- Departament d'Arquitectura de Computadors - Articles de revista [1.049]
- Departament de Teoria del Senyal i Comunicacions - Articles de revista [2.526]
- GCO - Grup de Comunicacions Òptiques - Articles de revista [238]
- CBA - Sistemes de Comunicacions i Arquitectures de Banda Ampla - Articles de revista [154]
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
A GRASP with pa ... k optimization problem.pdf | A GRASP with pathrelinking heuristic for the survivable IPMPLSoverWSON multilayer network optimization problem | 1,509Mb | Accés restringit |