Share Email Print
cover

Proceedings Paper

Preplanned recovery with redundant multicast trees in optical networks
Author(s): Lan Kong; Jitender S. Deogun; Maher Ali
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

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

Paper Details

Date Published: 1 October 2003
PDF: 5 pages
Proc. SPIE 5285, OptiComm 2003: Optical Networking and Communications, (1 October 2003); doi: 10.1117/12.533829
Show Author Affiliations
Lan Kong, Univ. of Nebraska/Lincoln (United States)
Jitender S. Deogun, Univ. of Nebraska/Lincoln (United States)
Maher Ali, Univ. of Nebraska/Lincoln (United States)


Published in SPIE Proceedings Vol. 5285:
OptiComm 2003: Optical Networking and Communications
Arun K. Somani; Zhensheng Zhang, Editor(s)

© SPIE. Terms of Use
Back to Top