Multicast backup reprovisioning problem for Hamiltonian cycle-based protection on WDM networks

Der-Rong Din, Jen Shen Huang

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

As networks grow in size and complexity, the chance and the impact of failures increase dramatically. The pre-allocated backup resources cannot provide 100% protection guarantee when continuous failures occur in a network. In this paper, the multicast backup re-provisioning problem (MBRP) for Hamiltonian cycle (HC)-based protection on WDM networks for the link-failure case is studied. We focus on how to recover the protecting capabilities of Hamiltonian cycle against the subsequent link-failures on WDM networks for multicast transmissions, after recovering the multicast trees affected by the previous link-failure. Since this problem is a hard problem, an algorithm, which consists of several heuristics and a genetic algorithm (GA), is proposed to solve it. The simulation results of the proposed method are also given. Experimental results indicate that the proposed algorithm can solve this problem efficiently.

Original languageEnglish
Pages (from-to)142-157
Number of pages16
JournalOptical Fiber Technology
Volume20
Issue number2
DOIs
Publication statusPublished - 2014 Jan 1

Fingerprint

Hamiltonians
Wavelength division multiplexing
Telecommunication links
Genetic algorithms

All Science Journal Classification (ASJC) codes

  • Electronic, Optical and Magnetic Materials
  • Control and Systems Engineering
  • Atomic and Molecular Physics, and Optics
  • Instrumentation
  • Electrical and Electronic Engineering

Cite this

@article{4ae63f07c17d4786b8eedc364923a5f5,
title = "Multicast backup reprovisioning problem for Hamiltonian cycle-based protection on WDM networks",
abstract = "As networks grow in size and complexity, the chance and the impact of failures increase dramatically. The pre-allocated backup resources cannot provide 100{\%} protection guarantee when continuous failures occur in a network. In this paper, the multicast backup re-provisioning problem (MBRP) for Hamiltonian cycle (HC)-based protection on WDM networks for the link-failure case is studied. We focus on how to recover the protecting capabilities of Hamiltonian cycle against the subsequent link-failures on WDM networks for multicast transmissions, after recovering the multicast trees affected by the previous link-failure. Since this problem is a hard problem, an algorithm, which consists of several heuristics and a genetic algorithm (GA), is proposed to solve it. The simulation results of the proposed method are also given. Experimental results indicate that the proposed algorithm can solve this problem efficiently.",
author = "Der-Rong Din and Huang, {Jen Shen}",
year = "2014",
month = "1",
day = "1",
doi = "10.1016/j.yofte.2014.01.005",
language = "English",
volume = "20",
pages = "142--157",
journal = "Optical Fiber Technology",
issn = "1068-5200",
publisher = "Academic Press Inc.",
number = "2",

}

Multicast backup reprovisioning problem for Hamiltonian cycle-based protection on WDM networks. / Din, Der-Rong; Huang, Jen Shen.

In: Optical Fiber Technology, Vol. 20, No. 2, 01.01.2014, p. 142-157.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Multicast backup reprovisioning problem for Hamiltonian cycle-based protection on WDM networks

AU - Din, Der-Rong

AU - Huang, Jen Shen

PY - 2014/1/1

Y1 - 2014/1/1

N2 - As networks grow in size and complexity, the chance and the impact of failures increase dramatically. The pre-allocated backup resources cannot provide 100% protection guarantee when continuous failures occur in a network. In this paper, the multicast backup re-provisioning problem (MBRP) for Hamiltonian cycle (HC)-based protection on WDM networks for the link-failure case is studied. We focus on how to recover the protecting capabilities of Hamiltonian cycle against the subsequent link-failures on WDM networks for multicast transmissions, after recovering the multicast trees affected by the previous link-failure. Since this problem is a hard problem, an algorithm, which consists of several heuristics and a genetic algorithm (GA), is proposed to solve it. The simulation results of the proposed method are also given. Experimental results indicate that the proposed algorithm can solve this problem efficiently.

AB - As networks grow in size and complexity, the chance and the impact of failures increase dramatically. The pre-allocated backup resources cannot provide 100% protection guarantee when continuous failures occur in a network. In this paper, the multicast backup re-provisioning problem (MBRP) for Hamiltonian cycle (HC)-based protection on WDM networks for the link-failure case is studied. We focus on how to recover the protecting capabilities of Hamiltonian cycle against the subsequent link-failures on WDM networks for multicast transmissions, after recovering the multicast trees affected by the previous link-failure. Since this problem is a hard problem, an algorithm, which consists of several heuristics and a genetic algorithm (GA), is proposed to solve it. The simulation results of the proposed method are also given. Experimental results indicate that the proposed algorithm can solve this problem efficiently.

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

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

U2 - 10.1016/j.yofte.2014.01.005

DO - 10.1016/j.yofte.2014.01.005

M3 - Article

AN - SCOPUS:84894608728

VL - 20

SP - 142

EP - 157

JO - Optical Fiber Technology

JF - Optical Fiber Technology

SN - 1068-5200

IS - 2

ER -