Diverse Routing for Shared Protection in Survivable Optical Networks

Pin Han Ho, J. Tapolcai, Hussein T. Mouftah

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

14 Citations (Scopus)

Abstract

This paper provides a suite of approaches to solving the survivable routing problem with shared protection. The problem diverse solving the least-cost working and protection path-pair (in terms of the sum of the cost) is formulated into Integer Linear Programming. We also introduce two heuristic algorithms, called Iterative Two-Step-Approach (ITSA) and Maximum Likelihood Relaxation (MLR), which aim to finding the approximating optimal solution within a limited amount of computation time. We examine the performance of the proposed schemes and make a comparison with some reported counterparts. It is observed that the ITSA scheme with a properly defined tolerance to the optimality can achieve the best performance at the expense of much longer computation time. MLR can provide an ultra-fast path selection process, which behaves as a good tradeoff between computation efficiency and performance.

Original languageEnglish
Title of host publicationConference Record / IEEE Global Telecommunications Conference
Pages2519-2523
Number of pages5
Volume5
Publication statusPublished - 2003
EventIEEE Global Telecommunications Conference GLOBECOM'03 - San Francisco, CA, United States
Duration: Dec 1 2003Dec 5 2003

Other

OtherIEEE Global Telecommunications Conference GLOBECOM'03
CountryUnited States
CitySan Francisco, CA
Period12/1/0312/5/03

Fingerprint

Fiber optic networks
routing
Maximum likelihood
linear programing
Heuristic algorithms
heuristics
cost
Linear programming
Costs
tolerance

Keywords

  • Diverse Routing
  • Shared Protection
  • Shared Risk Link Group (SRLG)
  • Single failure scenario
  • WDM

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Global and Planetary Change

Cite this

Ho, P. H., Tapolcai, J., & Mouftah, H. T. (2003). Diverse Routing for Shared Protection in Survivable Optical Networks. In Conference Record / IEEE Global Telecommunications Conference (Vol. 5, pp. 2519-2523)

Diverse Routing for Shared Protection in Survivable Optical Networks. / Ho, Pin Han; Tapolcai, J.; Mouftah, Hussein T.

Conference Record / IEEE Global Telecommunications Conference. Vol. 5 2003. p. 2519-2523.

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

Ho, PH, Tapolcai, J & Mouftah, HT 2003, Diverse Routing for Shared Protection in Survivable Optical Networks. in Conference Record / IEEE Global Telecommunications Conference. vol. 5, pp. 2519-2523, IEEE Global Telecommunications Conference GLOBECOM'03, San Francisco, CA, United States, 12/1/03.
Ho PH, Tapolcai J, Mouftah HT. Diverse Routing for Shared Protection in Survivable Optical Networks. In Conference Record / IEEE Global Telecommunications Conference. Vol. 5. 2003. p. 2519-2523
Ho, Pin Han ; Tapolcai, J. ; Mouftah, Hussein T. / Diverse Routing for Shared Protection in Survivable Optical Networks. Conference Record / IEEE Global Telecommunications Conference. Vol. 5 2003. pp. 2519-2523
@inproceedings{bcce38af604d4481ba2271a5df073b0b,
title = "Diverse Routing for Shared Protection in Survivable Optical Networks",
abstract = "This paper provides a suite of approaches to solving the survivable routing problem with shared protection. The problem diverse solving the least-cost working and protection path-pair (in terms of the sum of the cost) is formulated into Integer Linear Programming. We also introduce two heuristic algorithms, called Iterative Two-Step-Approach (ITSA) and Maximum Likelihood Relaxation (MLR), which aim to finding the approximating optimal solution within a limited amount of computation time. We examine the performance of the proposed schemes and make a comparison with some reported counterparts. It is observed that the ITSA scheme with a properly defined tolerance to the optimality can achieve the best performance at the expense of much longer computation time. MLR can provide an ultra-fast path selection process, which behaves as a good tradeoff between computation efficiency and performance.",
keywords = "Diverse Routing, Shared Protection, Shared Risk Link Group (SRLG), Single failure scenario, WDM",
author = "Ho, {Pin Han} and J. Tapolcai and Mouftah, {Hussein T.}",
year = "2003",
language = "English",
volume = "5",
pages = "2519--2523",
booktitle = "Conference Record / IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - Diverse Routing for Shared Protection in Survivable Optical Networks

AU - Ho, Pin Han

AU - Tapolcai, J.

AU - Mouftah, Hussein T.

PY - 2003

Y1 - 2003

N2 - This paper provides a suite of approaches to solving the survivable routing problem with shared protection. The problem diverse solving the least-cost working and protection path-pair (in terms of the sum of the cost) is formulated into Integer Linear Programming. We also introduce two heuristic algorithms, called Iterative Two-Step-Approach (ITSA) and Maximum Likelihood Relaxation (MLR), which aim to finding the approximating optimal solution within a limited amount of computation time. We examine the performance of the proposed schemes and make a comparison with some reported counterparts. It is observed that the ITSA scheme with a properly defined tolerance to the optimality can achieve the best performance at the expense of much longer computation time. MLR can provide an ultra-fast path selection process, which behaves as a good tradeoff between computation efficiency and performance.

AB - This paper provides a suite of approaches to solving the survivable routing problem with shared protection. The problem diverse solving the least-cost working and protection path-pair (in terms of the sum of the cost) is formulated into Integer Linear Programming. We also introduce two heuristic algorithms, called Iterative Two-Step-Approach (ITSA) and Maximum Likelihood Relaxation (MLR), which aim to finding the approximating optimal solution within a limited amount of computation time. We examine the performance of the proposed schemes and make a comparison with some reported counterparts. It is observed that the ITSA scheme with a properly defined tolerance to the optimality can achieve the best performance at the expense of much longer computation time. MLR can provide an ultra-fast path selection process, which behaves as a good tradeoff between computation efficiency and performance.

KW - Diverse Routing

KW - Shared Protection

KW - Shared Risk Link Group (SRLG)

KW - Single failure scenario

KW - WDM

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

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

M3 - Conference contribution

AN - SCOPUS:0842288484

VL - 5

SP - 2519

EP - 2523

BT - Conference Record / IEEE Global Telecommunications Conference

ER -