Delay-constrained survivable multicast routing problem on WDM networks

Der-Rong Din, Jhong Yan Jiang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In WDM network, a link failure may cause service disruption and may lead to significant information loss. Especially, when the failed link is on a light-tree that carries traffic to multiple destinations, the traffic to all the downstream destinations along the failed link will be affected. Moreover, for a multicast request, the delay bound associated with it can be decided according to the emergence degree or priority of the data. Transmitted data with delay bound reflects the realistic demand in the future. For a given multicast request with delay bound, a delay-constrained survivable multicast protection provides the primary tree and a set of spare resources; when the single-link failure occurs, the pre-configured spare resources can be used to construct a new multicast tree under the delay constraint. In this paper, given a multicast request with delay constraint, the goal is to allocate the delay-constrained primary multicast tree and protecting span p-cycles, when the single-link failure occurs, the multicast tree can be recovered by using protecting p-cycles such that the backup tree can also satisfy the delay constraint. This problem is defined as the Delay-Constrained Survivable Multicast Routing Problem (DCSMRP). The span p-cycles protection scheme is studied in this paper and a heuristic method Delay Constrained Span p-cycles Protection (DCSP) is proposed to solve it.

Original languageEnglish
Title of host publication2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010
Publication statusPublished - 2010 Dec 1
Event5th International ICST Conference on Communications and Networking in China, ChinaCom 2010 - Beijing, China
Duration: 2010 Aug 252010 Aug 27

Publication series

Name2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010

Other

Other5th International ICST Conference on Communications and Networking in China, ChinaCom 2010
CountryChina
CityBeijing
Period10-08-2510-08-27

Fingerprint

Wavelength division multiplexing
Telecommunication links
Heuristic methods
Telecommunication traffic
traffic
resources
heuristics
cause
demand

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Communication

Cite this

Din, D-R., & Jiang, J. Y. (2010). Delay-constrained survivable multicast routing problem on WDM networks. In 2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010 [5684782] (2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010).
Din, Der-Rong ; Jiang, Jhong Yan. / Delay-constrained survivable multicast routing problem on WDM networks. 2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010. 2010. (2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010).
@inproceedings{15f91469cc6c485a825d1bf0edaadfc1,
title = "Delay-constrained survivable multicast routing problem on WDM networks",
abstract = "In WDM network, a link failure may cause service disruption and may lead to significant information loss. Especially, when the failed link is on a light-tree that carries traffic to multiple destinations, the traffic to all the downstream destinations along the failed link will be affected. Moreover, for a multicast request, the delay bound associated with it can be decided according to the emergence degree or priority of the data. Transmitted data with delay bound reflects the realistic demand in the future. For a given multicast request with delay bound, a delay-constrained survivable multicast protection provides the primary tree and a set of spare resources; when the single-link failure occurs, the pre-configured spare resources can be used to construct a new multicast tree under the delay constraint. In this paper, given a multicast request with delay constraint, the goal is to allocate the delay-constrained primary multicast tree and protecting span p-cycles, when the single-link failure occurs, the multicast tree can be recovered by using protecting p-cycles such that the backup tree can also satisfy the delay constraint. This problem is defined as the Delay-Constrained Survivable Multicast Routing Problem (DCSMRP). The span p-cycles protection scheme is studied in this paper and a heuristic method Delay Constrained Span p-cycles Protection (DCSP) is proposed to solve it.",
author = "Der-Rong Din and Jiang, {Jhong Yan}",
year = "2010",
month = "12",
day = "1",
language = "English",
isbn = "9780984589333",
series = "2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010",
booktitle = "2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010",

}

Din, D-R & Jiang, JY 2010, Delay-constrained survivable multicast routing problem on WDM networks. in 2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010., 5684782, 2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010, 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010, Beijing, China, 10-08-25.

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

2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010. 2010. 5684782 (2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

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

AU - Din, Der-Rong

AU - Jiang, Jhong Yan

PY - 2010/12/1

Y1 - 2010/12/1

N2 - In WDM network, a link failure may cause service disruption and may lead to significant information loss. Especially, when the failed link is on a light-tree that carries traffic to multiple destinations, the traffic to all the downstream destinations along the failed link will be affected. Moreover, for a multicast request, the delay bound associated with it can be decided according to the emergence degree or priority of the data. Transmitted data with delay bound reflects the realistic demand in the future. For a given multicast request with delay bound, a delay-constrained survivable multicast protection provides the primary tree and a set of spare resources; when the single-link failure occurs, the pre-configured spare resources can be used to construct a new multicast tree under the delay constraint. In this paper, given a multicast request with delay constraint, the goal is to allocate the delay-constrained primary multicast tree and protecting span p-cycles, when the single-link failure occurs, the multicast tree can be recovered by using protecting p-cycles such that the backup tree can also satisfy the delay constraint. This problem is defined as the Delay-Constrained Survivable Multicast Routing Problem (DCSMRP). The span p-cycles protection scheme is studied in this paper and a heuristic method Delay Constrained Span p-cycles Protection (DCSP) is proposed to solve it.

AB - In WDM network, a link failure may cause service disruption and may lead to significant information loss. Especially, when the failed link is on a light-tree that carries traffic to multiple destinations, the traffic to all the downstream destinations along the failed link will be affected. Moreover, for a multicast request, the delay bound associated with it can be decided according to the emergence degree or priority of the data. Transmitted data with delay bound reflects the realistic demand in the future. For a given multicast request with delay bound, a delay-constrained survivable multicast protection provides the primary tree and a set of spare resources; when the single-link failure occurs, the pre-configured spare resources can be used to construct a new multicast tree under the delay constraint. In this paper, given a multicast request with delay constraint, the goal is to allocate the delay-constrained primary multicast tree and protecting span p-cycles, when the single-link failure occurs, the multicast tree can be recovered by using protecting p-cycles such that the backup tree can also satisfy the delay constraint. This problem is defined as the Delay-Constrained Survivable Multicast Routing Problem (DCSMRP). The span p-cycles protection scheme is studied in this paper and a heuristic method Delay Constrained Span p-cycles Protection (DCSP) is proposed to solve it.

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

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

M3 - Conference contribution

AN - SCOPUS:79851494050

SN - 9780984589333

T3 - 2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010

BT - 2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010

ER -

Din D-R, Jiang JY. Delay-constrained survivable multicast routing problem on WDM networks. In 2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010. 2010. 5684782. (2010 5th International ICST Conference on Communications and Networking in China, ChinaCom 2010).