A deeper study on segment shared protection

J. Tapolcai, Pin Han Ho

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

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
Title of host publicationProceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN
EditorsD.F. Hsu, K. Hiraki, S. Shen, H. Sudborough
Pages319-325
Number of pages7
DOIs
Publication statusPublished - 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

Fingerprint

Merging
Restoration
Telecommunication networks
Tunnels
Bandwidth

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)

Cite this

Tapolcai, J., & Ho, P. H. (2004). A deeper study on segment shared protection. In D. F. Hsu, K. Hiraki, S. Shen, & H. Sudborough (Eds.), Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN (pp. 319-325) https://doi.org/10.1109/ISPAN.2004.1300499

A deeper study on segment shared protection. / Tapolcai, J.; Ho, Pin Han.

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. ed. / D.F. Hsu; K. Hiraki; S. Shen; H. Sudborough. 2004. p. 319-325.

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

Tapolcai, J & Ho, PH 2004, A deeper study on segment shared protection. in DF Hsu, K Hiraki, S Shen & H Sudborough (eds), Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. pp. 319-325, Proceedings on the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN, Hong Kong, China, 5/10/04. https://doi.org/10.1109/ISPAN.2004.1300499
Tapolcai J, Ho PH. A deeper study on segment shared protection. In Hsu DF, Hiraki K, Shen S, Sudborough H, editors, Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. 2004. p. 319-325 https://doi.org/10.1109/ISPAN.2004.1300499
Tapolcai, J. ; Ho, Pin Han. / A deeper study on segment shared protection. Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. editor / D.F. Hsu ; K. Hiraki ; S. Shen ; H. Sudborough. 2004. pp. 319-325
@inproceedings{0576e0ef17b348bfa14a79d2c2b59e4a,
title = "A deeper study on segment shared protection",
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.",
keywords = "Integer linear program (ILP), Protection and restoration, Protection domain, Restoration time, Segment shared protection (SSP), Switching/merging",
author = "J. Tapolcai and Ho, {Pin Han}",
year = "2004",
doi = "10.1109/ISPAN.2004.1300499",
language = "English",
pages = "319--325",
editor = "D.F. Hsu and K. Hiraki and S. Shen and H. Sudborough",
booktitle = "Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN",

}

TY - GEN

T1 - A deeper study on segment shared protection

AU - Tapolcai, J.

AU - Ho, Pin Han

PY - 2004

Y1 - 2004

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

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

KW - Integer linear program (ILP)

KW - Protection and restoration

KW - Protection domain

KW - Restoration time

KW - Segment shared protection (SSP)

KW - Switching/merging

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

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

U2 - 10.1109/ISPAN.2004.1300499

DO - 10.1109/ISPAN.2004.1300499

M3 - Conference contribution

AN - SCOPUS:3543063598

SP - 319

EP - 325

BT - Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

A2 - Hsu, D.F.

A2 - Hiraki, K.

A2 - Shen, S.

A2 - Sudborough, H.

ER -