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

Der Rong Din, Chen Yu Lien

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)165-192
Number of pages28
JournalComputer Communications
Volume103
DOIs
Publication statusPublished - 2017 May 1

    Fingerprint

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this