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 language | English (US) |
|---|---|
| Pages (from-to) | 419-423 |
| Number of pages | 5 |
| Journal | Proceedings of SPIE - The International Society for Optical Engineering |
| Volume | 5285 |
| DOIs | |
| State | Published - 2003 |
| Event | OptiComm 2003: Optical Networking and Communications - Dallas, TX, United States Duration: Oct 13 2003 → Oct 17 2003 |
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