Delay-constrained survivable multicast routing problem on WDM networks for node failure case

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

Full description

Saved in:
Bibliographic Details
Published inComputer communications Vol. 103; pp. 165 - 192
Main Authors Din, Der-Rong, Lien, Chen-Yu
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.05.2017
Subjects
Delay-constrained
Multicast routing
Node failure
Survivability
WDM
WDM
Multicast routing
Survivability
Delay-constrained
Node failure
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0140-3664
1873-703X
DOI:10.1016/j.comcom.2017.01.018