Delay-constrained survivable multicast routing problem in WDM networks

Der Rong Din, Jhong Yan Jiang

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

In WDM network, link failure may cause service disruption and may lead to lose significant information. Especially, for a multicast transmission when link on a light-tree that carries traffic to multiple destinations failed, the traffic to all the downstream destinations along the failed link will be affected. For a given multicast request with a maximum delay denoted as Δ, the delay-constrained survivable multicast mechanism provides the primary multicast tree and some sparse resources to protect it. When link failure occurred, the multicast transmission is recovered by using sparse resources while ensuring that the backup tree can satisfy the delay constraint. This problem is called Delay-Constrained Survivable Multicast Routing Problem (DCSMRP). In this article, three protection methods are used to solve this problem; they are: Delay Constrained Link-disjoint Tree Protection (DCLTP), Delay Constrained Disjoint-Paths Protection (DCDPP) and Delay Constrained Span p-Cycle Protection (DCSP). Three multicast routing methods are proposed for the respective protecting methods to find the primary multicast tree and backup resources with delay constraint. Experiments are conducted to evaluate the resource utility ratio (RUR), blocking ratio (BR) and executing time (RT) of these methods. Simulations show that the DCSP method can get best BR for the cases with greater delay bound (for the cases with delay bound Δ > 5.5 ms.) The RUR of DCSP is worse than that of DCLTP and DCDPP (in the cases with delay bound Δ≥7.5msec), and the computational time of the DCDPP is faster than that of the DCSP and DCLTP.

Original languageEnglish
Pages (from-to)1172-1184
Number of pages13
JournalComputer Communications
Volume35
Issue number10
DOIs
Publication statusPublished - 2012 Jun 1

Fingerprint

Wavelength division multiplexing
Telecommunication links
Telecommunication traffic
Experiments

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

@article{d03f16c2e44648a5b3598848718f421d,
title = "Delay-constrained survivable multicast routing problem in WDM networks",
abstract = "In WDM network, link failure may cause service disruption and may lead to lose significant information. Especially, for a multicast transmission when link on a light-tree that carries traffic to multiple destinations failed, the traffic to all the downstream destinations along the failed link will be affected. For a given multicast request with a maximum delay denoted as Δ, the delay-constrained survivable multicast mechanism provides the primary multicast tree and some sparse resources to protect it. When link failure occurred, the multicast transmission is recovered by using sparse resources while ensuring that the backup tree can satisfy the delay constraint. This problem is called Delay-Constrained Survivable Multicast Routing Problem (DCSMRP). In this article, three protection methods are used to solve this problem; they are: Delay Constrained Link-disjoint Tree Protection (DCLTP), Delay Constrained Disjoint-Paths Protection (DCDPP) and Delay Constrained Span p-Cycle Protection (DCSP). Three multicast routing methods are proposed for the respective protecting methods to find the primary multicast tree and backup resources with delay constraint. Experiments are conducted to evaluate the resource utility ratio (RUR), blocking ratio (BR) and executing time (RT) of these methods. Simulations show that the DCSP method can get best BR for the cases with greater delay bound (for the cases with delay bound Δ > 5.5 ms.) The RUR of DCSP is worse than that of DCLTP and DCDPP (in the cases with delay bound Δ≥7.5msec), and the computational time of the DCDPP is faster than that of the DCSP and DCLTP.",
author = "Din, {Der Rong} and Jiang, {Jhong Yan}",
year = "2012",
month = "6",
day = "1",
doi = "10.1016/j.comcom.2012.03.003",
language = "English",
volume = "35",
pages = "1172--1184",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "10",

}

Delay-constrained survivable multicast routing problem in WDM networks. / Din, Der Rong; Jiang, Jhong Yan.

In: Computer Communications, Vol. 35, No. 10, 01.06.2012, p. 1172-1184.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Delay-constrained survivable multicast routing problem in WDM networks

AU - Din, Der Rong

AU - Jiang, Jhong Yan

PY - 2012/6/1

Y1 - 2012/6/1

N2 - In WDM network, link failure may cause service disruption and may lead to lose significant information. Especially, for a multicast transmission when link on a light-tree that carries traffic to multiple destinations failed, the traffic to all the downstream destinations along the failed link will be affected. For a given multicast request with a maximum delay denoted as Δ, the delay-constrained survivable multicast mechanism provides the primary multicast tree and some sparse resources to protect it. When link failure occurred, the multicast transmission is recovered by using sparse resources while ensuring that the backup tree can satisfy the delay constraint. This problem is called Delay-Constrained Survivable Multicast Routing Problem (DCSMRP). In this article, three protection methods are used to solve this problem; they are: Delay Constrained Link-disjoint Tree Protection (DCLTP), Delay Constrained Disjoint-Paths Protection (DCDPP) and Delay Constrained Span p-Cycle Protection (DCSP). Three multicast routing methods are proposed for the respective protecting methods to find the primary multicast tree and backup resources with delay constraint. Experiments are conducted to evaluate the resource utility ratio (RUR), blocking ratio (BR) and executing time (RT) of these methods. Simulations show that the DCSP method can get best BR for the cases with greater delay bound (for the cases with delay bound Δ > 5.5 ms.) The RUR of DCSP is worse than that of DCLTP and DCDPP (in the cases with delay bound Δ≥7.5msec), and the computational time of the DCDPP is faster than that of the DCSP and DCLTP.

AB - In WDM network, link failure may cause service disruption and may lead to lose significant information. Especially, for a multicast transmission when link on a light-tree that carries traffic to multiple destinations failed, the traffic to all the downstream destinations along the failed link will be affected. For a given multicast request with a maximum delay denoted as Δ, the delay-constrained survivable multicast mechanism provides the primary multicast tree and some sparse resources to protect it. When link failure occurred, the multicast transmission is recovered by using sparse resources while ensuring that the backup tree can satisfy the delay constraint. This problem is called Delay-Constrained Survivable Multicast Routing Problem (DCSMRP). In this article, three protection methods are used to solve this problem; they are: Delay Constrained Link-disjoint Tree Protection (DCLTP), Delay Constrained Disjoint-Paths Protection (DCDPP) and Delay Constrained Span p-Cycle Protection (DCSP). Three multicast routing methods are proposed for the respective protecting methods to find the primary multicast tree and backup resources with delay constraint. Experiments are conducted to evaluate the resource utility ratio (RUR), blocking ratio (BR) and executing time (RT) of these methods. Simulations show that the DCSP method can get best BR for the cases with greater delay bound (for the cases with delay bound Δ > 5.5 ms.) The RUR of DCSP is worse than that of DCLTP and DCDPP (in the cases with delay bound Δ≥7.5msec), and the computational time of the DCDPP is faster than that of the DCSP and DCLTP.

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

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

U2 - 10.1016/j.comcom.2012.03.003

DO - 10.1016/j.comcom.2012.03.003

M3 - Article

AN - SCOPUS:84861182208

VL - 35

SP - 1172

EP - 1184

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 10

ER -