Building redundant multicast trees for preplanned recovery in WDM optical networks

Lan Kong, Maher Ali, Jitender S. Deogun

Research output: Contribution to journalArticle

8 Citations (Scopus)

Abstract

In this paper, we investigate the problem of Preplanned Recovery with Redundant Multicast Trees (PRRMT) in optical networks. The redundant trees ensure the source node remains connected to all destination nodes for a multicast session request under single edge or node failures. Our objective is to minimize the total number of links used for both trees. We show that PRRMT can be formulated as an integer linear program (ILP), and also develop a heuristic algorithm. The ILP approach and heuristic algorithm are experimentally evaluated on 14-node NSFNET, 21-node Italian network, and a randomly generated 40-node mesh network. From experimental results, we conclude that: (1) ILP approach leads to optimal solutions for NSFNET and Italian network but does not converge for many instances of arbitrary topologies, (2) Our heuristic algorithm yields optimal or near optimal results in very short time, and (3) The edge-disjoint trees can protect the transmission for an edge failure or a node failure.

Original languageEnglish (US)
Pages (from-to)379-398
Number of pages20
JournalJournal of High Speed Networks
Volume15
Issue number4
StatePublished - Nov 16 2006

Fingerprint

Heuristic algorithms
Fiber optic networks
Wavelength division multiplexing
Recovery
Topology

Keywords

  • Multicast Tress
  • Preplanned Recovery
  • Protection
  • VDM optical networks

ASJC Scopus subject areas

  • Information Systems
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Building redundant multicast trees for preplanned recovery in WDM optical networks. / Kong, Lan; Ali, Maher; Deogun, Jitender S.

In: Journal of High Speed Networks, Vol. 15, No. 4, 16.11.2006, p. 379-398.

Research output: Contribution to journalArticle

@article{207419bc8ffa4f51a65e0e8ecd0c9c4f,
title = "Building redundant multicast trees for preplanned recovery in WDM optical networks",
abstract = "In this paper, we investigate the problem of Preplanned Recovery with Redundant Multicast Trees (PRRMT) in optical networks. The redundant trees ensure the source node remains connected to all destination nodes for a multicast session request under single edge or node failures. Our objective is to minimize the total number of links used for both trees. We show that PRRMT can be formulated as an integer linear program (ILP), and also develop a heuristic algorithm. The ILP approach and heuristic algorithm are experimentally evaluated on 14-node NSFNET, 21-node Italian network, and a randomly generated 40-node mesh network. From experimental results, we conclude that: (1) ILP approach leads to optimal solutions for NSFNET and Italian network but does not converge for many instances of arbitrary topologies, (2) Our heuristic algorithm yields optimal or near optimal results in very short time, and (3) The edge-disjoint trees can protect the transmission for an edge failure or a node failure.",
keywords = "Multicast Tress, Preplanned Recovery, Protection, VDM optical networks",
author = "Lan Kong and Maher Ali and Deogun, {Jitender S.}",
year = "2006",
month = "11",
day = "16",
language = "English (US)",
volume = "15",
pages = "379--398",
journal = "Journal of High Speed Networks",
issn = "0926-6801",
publisher = "IOS Press",
number = "4",

}

TY - JOUR

T1 - Building redundant multicast trees for preplanned recovery in WDM optical networks

AU - Kong, Lan

AU - Ali, Maher

AU - Deogun, Jitender S.

PY - 2006/11/16

Y1 - 2006/11/16

N2 - In this paper, we investigate the problem of Preplanned Recovery with Redundant Multicast Trees (PRRMT) in optical networks. The redundant trees ensure the source node remains connected to all destination nodes for a multicast session request under single edge or node failures. Our objective is to minimize the total number of links used for both trees. We show that PRRMT can be formulated as an integer linear program (ILP), and also develop a heuristic algorithm. The ILP approach and heuristic algorithm are experimentally evaluated on 14-node NSFNET, 21-node Italian network, and a randomly generated 40-node mesh network. From experimental results, we conclude that: (1) ILP approach leads to optimal solutions for NSFNET and Italian network but does not converge for many instances of arbitrary topologies, (2) Our heuristic algorithm yields optimal or near optimal results in very short time, and (3) The edge-disjoint trees can protect the transmission for an edge failure or a node failure.

AB - In this paper, we investigate the problem of Preplanned Recovery with Redundant Multicast Trees (PRRMT) in optical networks. The redundant trees ensure the source node remains connected to all destination nodes for a multicast session request under single edge or node failures. Our objective is to minimize the total number of links used for both trees. We show that PRRMT can be formulated as an integer linear program (ILP), and also develop a heuristic algorithm. The ILP approach and heuristic algorithm are experimentally evaluated on 14-node NSFNET, 21-node Italian network, and a randomly generated 40-node mesh network. From experimental results, we conclude that: (1) ILP approach leads to optimal solutions for NSFNET and Italian network but does not converge for many instances of arbitrary topologies, (2) Our heuristic algorithm yields optimal or near optimal results in very short time, and (3) The edge-disjoint trees can protect the transmission for an edge failure or a node failure.

KW - Multicast Tress

KW - Preplanned Recovery

KW - Protection

KW - VDM optical networks

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

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

M3 - Article

AN - SCOPUS:33750908269

VL - 15

SP - 379

EP - 398

JO - Journal of High Speed Networks

JF - Journal of High Speed Networks

SN - 0926-6801

IS - 4

ER -