A deeper study on segment shared protection

János Tapolcai, Pin Han Ho

Research output: Contribution to conferencePaper

6 Citations (Scopus)

Abstract

This paper studies the survivable routing problem for Segment Shared Protection (SSP) in mesh communication networks with bandwidth-guaranteed tunnels. Firstly, the NP-completeness proof is given to this problem. Then, we extend the Integer Linear Program (ILP) formulation for SSP published in [1] by additionally considering the constraint on the restoration time for each connection request and the switching/merging capability in each node. Extensive simulation efforts are addressed to investigate the performance impairment by adopting different upper bounds of the two constraints. The computation time and the problem size in the CPLEX solver are analyzed.

Original languageEnglish
Pages319-325
Number of pages7
DOIs
Publication statusPublished - Aug 16 2004
EventProceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN - Hong Kong, China
Duration: May 10 2004May 12 2004

Other

OtherProceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN
CountryChina
CityHong Kong
Period5/10/045/12/04

Keywords

  • Integer linear program (ILP)
  • Protection and restoration
  • Protection domain
  • Restoration time
  • Segment shared protection (SSP)
  • Switching/merging

ASJC Scopus subject areas

  • Computer Science(all)

Fingerprint Dive into the research topics of 'A deeper study on segment shared protection'. Together they form a unique fingerprint.

  • Cite this

    Tapolcai, J., & Ho, P. H. (2004). A deeper study on segment shared protection. 319-325. Paper presented at Proceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN, Hong Kong, China. https://doi.org/10.1109/ISPAN.2004.1300499