GA-Based hybrid algorithm for MBR problem of FIPP p-cycles for node failure on survivable WDM networks

Authors:
Der-Rong Din
Affiliations:
Department of Computer Science and Information Engineering, National Changhua University of Education, Changhua, Taiwan, R.O.C
Venue:
ICIC'11 Proceedings of the 7th international conference on Intelligent Computing: bio-inspired computing and applications
Year:
2011

Citing 2
Cited 0

IP Local Node Protection

ICSNC '07 Proceedings of the Second International Conference on Systems and Networks Communications
IP layer restoration and network planning based on virtual protection cycles

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, the minimal backup reprovisioning (MBR) problem is studied, in which, the failure-independent path protecting p-cycles (FIPP p-cycles) scheme is considered for single node-failure on WDM networks. After recovering the affected lightpaths from a node failure, the goal of the MBR is to re-arrange the protecting and available resources such that working paths can be protected against next node failure if possible. This is a hard problem, a hybrid algorithm which combines heuristic algorithm and genetic algorithm is proposed to solve this problem. The simulation results of the proposed method are also given.