TY - JOUR
T1 - Delay-constrained survivable multicast routing problem on WDM networks for node failure case
AU - Din, Der Rong
AU - Lien, Chen Yu
PY - 2017/5/1
Y1 - 2017/5/1
N2 - With the rapid evolution of multimedia and real-time applications like audio/video conferencing, certain quality-of-service (QoS) should be guaranteed for the multicast transmission. For the given delay-constrained multicast request, the goal of delay-constrained survivable multicast routing problem (DCSMRP) is to provide the primary multicast tree and protecting resources so that after recovering from the link (node)-failure, the recovered tree can satisfy the delay constraint. In this article, the DCSMRP with a single node-failure case on wavelength-division multiplexing (WDM) networks is considered. Three node-failure protecting methods, includes node-disjoint trees (NDT), node-encircling p-cycles (NEPCs) and failure-independent path protecting p-cycles (FIPP p-cycles) are used in this article. For each protecting method, an algorithm is designed to solve the studied problem. Simulations are also conducted to evaluate the performance of the proposed algorithms.
AB - With the rapid evolution of multimedia and real-time applications like audio/video conferencing, certain quality-of-service (QoS) should be guaranteed for the multicast transmission. For the given delay-constrained multicast request, the goal of delay-constrained survivable multicast routing problem (DCSMRP) is to provide the primary multicast tree and protecting resources so that after recovering from the link (node)-failure, the recovered tree can satisfy the delay constraint. In this article, the DCSMRP with a single node-failure case on wavelength-division multiplexing (WDM) networks is considered. Three node-failure protecting methods, includes node-disjoint trees (NDT), node-encircling p-cycles (NEPCs) and failure-independent path protecting p-cycles (FIPP p-cycles) are used in this article. For each protecting method, an algorithm is designed to solve the studied problem. Simulations are also conducted to evaluate the performance of the proposed algorithms.
UR - http://www.scopus.com/inward/record.url?scp=85012912343&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85012912343&partnerID=8YFLogxK
U2 - 10.1016/j.comcom.2017.01.018
DO - 10.1016/j.comcom.2017.01.018
M3 - Article
AN - SCOPUS:85012912343
VL - 103
SP - 165
EP - 192
JO - Computer Communications
JF - Computer Communications
SN - 0140-3664
ER -