Share Email Print

Proceedings Paper

Linear formulation for segment shared protection
Author(s): Janos Tapolcai; Pin-Han Ho
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

This paper proposes a novel linear formulation for the problem of segment shared protection, where the switching/merging nodes and the least-cost link-disjoint working and protection segments corresponding to each switching/merging node-pair are jointly determined for a connection request. A novel approach of arc-reversal graph transformation is introduced. We verify the ILP and compare it with three reported approaches for solving the segment shared protection problem, namely CDR, PROMISE, and OPDA, by launching dynamic connection requests on two network topologies. From the experiment results, we observe that the ILP can always yield better results in terms of the total cost taken by the working and protection segments. We conclude that the proposed ILP formulation is a step ahead of the most state-of-the-art techniques in solving the shared protection problem, which provides a means of evaluating any other segment shared protection algorithms.

Paper Details

Date Published: 1 October 2003
PDF: 10 pages
Proc. SPIE 5285, OptiComm 2003: Optical Networking and Communications, (1 October 2003);
Show Author Affiliations
Janos Tapolcai, Univ. of Waterloo (Canada)
Pin-Han Ho, Univ. of Waterloo (Canada)

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
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?