Preplanned Recovery with Redundant Multicast Trees in Optical Networks

Lan Kong, Jitender S. Deogun, Maher Ali

Research output: Contribution to journalConference article

1 Citation (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 failures. Our objective is to minimize the total number of links used for both trees. We formulate PRRMT 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 and 21-node Italian network. Experimental results show that: 1) ILP approach leads to optimal solutions but requires prohibitively long time, 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.

Original languageEnglish (US)
Pages (from-to)419-423
Number of pages5
JournalProceedings of SPIE - The International Society for Optical Engineering
Volume5285
StatePublished - Dec 1 2003
EventOptiComm 2003: Optical Networking and Communications - Dallas, TX, United States
Duration: Oct 13 2003Oct 17 2003

Fingerprint

Optical Networks
Heuristic algorithms
Fiber optic networks
Multicast
Recovery
recovery
Integer Program
Linear Program
Heuristic algorithm
integers
Vertex of a graph
Disjoint
Optimal Solution
Minimise
Experimental Results

Keywords

  • Edge-disjoint trees
  • ILP
  • Optical networks
  • Preplanned recovery
  • Redundant multicast trees

ASJC Scopus subject areas

  • Electronic, Optical and Magnetic Materials
  • Condensed Matter Physics
  • Computer Science Applications
  • Applied Mathematics
  • Electrical and Electronic Engineering

Cite this

Preplanned Recovery with Redundant Multicast Trees in Optical Networks. / Kong, Lan; Deogun, Jitender S.; Ali, Maher.

In: Proceedings of SPIE - The International Society for Optical Engineering, Vol. 5285, 01.12.2003, p. 419-423.

Research output: Contribution to journalConference article

@article{9f8db540d3d341df8597b92d67353ad5,
title = "Preplanned Recovery with Redundant Multicast Trees in 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 failures. Our objective is to minimize the total number of links used for both trees. We formulate PRRMT 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 and 21-node Italian network. Experimental results show that: 1) ILP approach leads to optimal solutions but requires prohibitively long time, 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.",
keywords = "Edge-disjoint trees, ILP, Optical networks, Preplanned recovery, Redundant multicast trees",
author = "Lan Kong and Deogun, {Jitender S.} and Maher Ali",
year = "2003",
month = "12",
day = "1",
language = "English (US)",
volume = "5285",
pages = "419--423",
journal = "Proceedings of SPIE - The International Society for Optical Engineering",
issn = "0277-786X",
publisher = "SPIE",

}

TY - JOUR

T1 - Preplanned Recovery with Redundant Multicast Trees in Optical Networks

AU - Kong, Lan

AU - Deogun, Jitender S.

AU - Ali, Maher

PY - 2003/12/1

Y1 - 2003/12/1

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 failures. Our objective is to minimize the total number of links used for both trees. We formulate PRRMT 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 and 21-node Italian network. Experimental results show that: 1) ILP approach leads to optimal solutions but requires prohibitively long time, 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.

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 failures. Our objective is to minimize the total number of links used for both trees. We formulate PRRMT 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 and 21-node Italian network. Experimental results show that: 1) ILP approach leads to optimal solutions but requires prohibitively long time, 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.

KW - Edge-disjoint trees

KW - ILP

KW - Optical networks

KW - Preplanned recovery

KW - Redundant multicast trees

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

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

M3 - Conference article

AN - SCOPUS:1242352619

VL - 5285

SP - 419

EP - 423

JO - Proceedings of SPIE - The International Society for Optical Engineering

JF - Proceedings of SPIE - The International Society for Optical Engineering

SN - 0277-786X

ER -