Linear Formulation for Segment Shared Protection

J. Tapolcai, Pin Han Ho

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publicationProceedings of SPIE - The International Society for Optical Engineering
EditorsA.K. Somani, Z. Zhang
Pages49-58
Number of pages10
Volume5285
Publication statusPublished - 2003
EventOptiComm 2003: Optical Networking and Communications - Dallas, TX, United States
Duration: Oct 13 2003Oct 17 2003

Other

OtherOptiComm 2003: Optical Networking and Communications
CountryUnited States
CityDallas, TX
Period10/13/0310/17/03

Fingerprint

Inductive logic programming (ILP)
Merging
formulations
Launching
Costs
Topology
costs
launching
topology
arcs
Experiments

Keywords

  • Integer Linear Programming (ILP)
  • Segment shared protection
  • Shared risk link group (SRLG)

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Condensed Matter Physics

Cite this

Tapolcai, J., & Ho, P. H. (2003). Linear Formulation for Segment Shared Protection. In A. K. Somani, & Z. Zhang (Eds.), Proceedings of SPIE - The International Society for Optical Engineering (Vol. 5285, pp. 49-58)

Linear Formulation for Segment Shared Protection. / Tapolcai, J.; Ho, Pin Han.

Proceedings of SPIE - The International Society for Optical Engineering. ed. / A.K. Somani; Z. Zhang. Vol. 5285 2003. p. 49-58.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tapolcai, J & Ho, PH 2003, Linear Formulation for Segment Shared Protection. in AK Somani & Z Zhang (eds), Proceedings of SPIE - The International Society for Optical Engineering. vol. 5285, pp. 49-58, OptiComm 2003: Optical Networking and Communications, Dallas, TX, United States, 10/13/03.
Tapolcai J, Ho PH. Linear Formulation for Segment Shared Protection. In Somani AK, Zhang Z, editors, Proceedings of SPIE - The International Society for Optical Engineering. Vol. 5285. 2003. p. 49-58
Tapolcai, J. ; Ho, Pin Han. / Linear Formulation for Segment Shared Protection. Proceedings of SPIE - The International Society for Optical Engineering. editor / A.K. Somani ; Z. Zhang. Vol. 5285 2003. pp. 49-58
@inproceedings{afc54498260e4679a7de02ab54122c5e,
title = "Linear Formulation for Segment Shared Protection",
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.",
keywords = "Integer Linear Programming (ILP), Segment shared protection, Shared risk link group (SRLG)",
author = "J. Tapolcai and Ho, {Pin Han}",
year = "2003",
language = "English",
volume = "5285",
pages = "49--58",
editor = "A.K. Somani and Z. Zhang",
booktitle = "Proceedings of SPIE - The International Society for Optical Engineering",

}

TY - GEN

T1 - Linear Formulation for Segment Shared Protection

AU - Tapolcai, J.

AU - Ho, Pin Han

PY - 2003

Y1 - 2003

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

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

KW - Integer Linear Programming (ILP)

KW - Segment shared protection

KW - Shared risk link group (SRLG)

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

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

M3 - Conference contribution

VL - 5285

SP - 49

EP - 58

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

A2 - Somani, A.K.

A2 - Zhang, Z.

ER -