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

Der Rong Din

doi:10.1007/978-3-642-24553-4_26

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

Der Rong Din

Department of Computer Science and Information Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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.

Original language	English
Title of host publication	Bio-Inspired Computing and Applications - 7th International Conference on Intelligent Computing, ICIC 2011, Revised Selected Papers
Pages	183-190
Number of pages	8
DOIs	https://doi.org/10.1007/978-3-642-24553-4_26
Publication status	Published - 2011 Dec 1
Event	7th International Conference on Intelligent Computing, ICIC 2011 - Zhengzhou, China Duration: 2011 Aug 11 → 2011 Aug 14

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	6840 LNBI
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	7th International Conference on Intelligent Computing, ICIC 2011
Country	China
City	Zhengzhou
Period	11-08-11 → 11-08-14

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/978-3-642-24553-4_26

Fingerprint Dive into the research topics of 'GA-based hybrid algorithm for MBR problem of FIPP p-cycles for node failure on survivable WDM networks'. Together they form a unique fingerprint.

Cite this

Din, D. R. (2011). GA-based hybrid algorithm for MBR problem of FIPP p-cycles for node failure on survivable WDM networks. In Bio-Inspired Computing and Applications - 7th International Conference on Intelligent Computing, ICIC 2011, Revised Selected Papers (pp. 183-190). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6840 LNBI). https://doi.org/10.1007/978-3-642-24553-4_26

Din, Der Rong. / GA-based hybrid algorithm for MBR problem of FIPP p-cycles for node failure on survivable WDM networks. Bio-Inspired Computing and Applications - 7th International Conference on Intelligent Computing, ICIC 2011, Revised Selected Papers. 2011. pp. 183-190 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{8939925cd9064d1eb51af736ce13e2d9,

title = "GA-based hybrid algorithm for MBR problem of FIPP p-cycles for node failure on survivable WDM networks",

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.",

author = "Din, {Der Rong}",

year = "2011",

month = dec,

day = "1",

doi = "10.1007/978-3-642-24553-4_26",

language = "English",

isbn = "9783642245527",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "183--190",

booktitle = "Bio-Inspired Computing and Applications - 7th International Conference on Intelligent Computing, ICIC 2011, Revised Selected Papers",

note = "7th International Conference on Intelligent Computing, ICIC 2011 ; Conference date: 11-08-2011 Through 14-08-2011",

}

Din, DR 2011, GA-based hybrid algorithm for MBR problem of FIPP p-cycles for node failure on survivable WDM networks. in Bio-Inspired Computing and Applications - 7th International Conference on Intelligent Computing, ICIC 2011, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6840 LNBI, pp. 183-190, 7th International Conference on Intelligent Computing, ICIC 2011, Zhengzhou, China, 11-08-11. https://doi.org/10.1007/978-3-642-24553-4_26

GA-based hybrid algorithm for MBR problem of FIPP p-cycles for node failure on survivable WDM networks. / Din, Der Rong.

Bio-Inspired Computing and Applications - 7th International Conference on Intelligent Computing, ICIC 2011, Revised Selected Papers. 2011. p. 183-190 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6840 LNBI).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

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

AU - Din, Der Rong

PY - 2011/12/1

Y1 - 2011/12/1

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

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

UR - http://www.scopus.com/inward/record.url?scp=84855674069&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84855674069&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-24553-4_26

DO - 10.1007/978-3-642-24553-4_26

M3 - Conference contribution

AN - SCOPUS:84855674069

SN - 9783642245527

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 183

EP - 190

BT - Bio-Inspired Computing and Applications - 7th International Conference on Intelligent Computing, ICIC 2011, Revised Selected Papers

T2 - 7th International Conference on Intelligent Computing, ICIC 2011

Y2 - 11 August 2011 through 14 August 2011

ER -

Din DR. GA-based hybrid algorithm for MBR problem of FIPP p-cycles for node failure on survivable WDM networks. In Bio-Inspired Computing and Applications - 7th International Conference on Intelligent Computing, ICIC 2011, Revised Selected Papers. 2011. p. 183-190. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-24553-4_26