loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04)
A Deeper Study on Segment Shared Protection
Hong Kong, SAR, China
May 10-May 12
ISBN: 0-7695-2135-5
ASCII Text
x 
 
J?nos Tapolcai, Pin-Han Ho, "A Deeper Study on Segment Shared Protection," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 319, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/ISPAN.2004.1300499,
author = {J?nos Tapolcai and Pin-Han Ho},
title = {A Deeper Study on Segment Shared Protection},
journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on},
volume = {0},
year = {2004},
issn = {1087-4089},
pages = {319},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2004.1300499},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Architectures, Algorithms, and Networks, International Symposium on
TI - A Deeper Study on Segment Shared Protection
SN - 1087-4089
SP
EP
A1 - J?nos Tapolcai,
A1 - Pin-Han Ho,
PY - 2004
KW - segment shared protection (SSP)
KW - integer linear program (ILP)
KW - restoration time
KW - protection and restoration
KW - protection domain
KW - switching/merging
VL - 0
JA - Parallel Architectures, Algorithms, and Networks, International Symposium on
ER -
 
J?nos Tapolcai, University of Waterloo, Canada
Pin-Han Ho, University of Waterloo, Canada
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 [Segment Shared Protection in Mesh Communication Networks with Bandwidth Guaranteed Tunnels] 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.
Index Terms:
segment shared protection (SSP), integer linear program (ILP), restoration time, protection and restoration, protection domain, switching/merging
Citation:
J?nos Tapolcai, Pin-Han Ho, "A Deeper Study on Segment Shared Protection," ispan, pp.319, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.