Dynamic survivable routing for shared segment protection

János Tapolcai, Pin Han Ho

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

Original languageEnglish
Pages (from-to)198-209
Number of pages12
JournalJournal of Communications and Networks
Volume9
Issue number2
Publication statusPublished - Jun 2007

Fingerprint

Merging
Restoration
Telecommunication networks
Topology
Costs

Keywords

  • Complete routing information scenario
  • Integer linear program (ILP)
  • Shared risk group (SRG)
  • Shared segment protection (SSP)
  • Working and protection (W-P) paths

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

Dynamic survivable routing for shared segment protection. / Tapolcai, János; Ho, Pin Han.

In: Journal of Communications and Networks, Vol. 9, No. 2, 06.2007, p. 198-209.

Research output: Contribution to journalArticle

@article{5d24a8b97d254078a085fc08de61c25b,
title = "Dynamic survivable routing for shared segment protection",
abstract = "This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.",
keywords = "Complete routing information scenario, Integer linear program (ILP), Shared risk group (SRG), Shared segment protection (SSP), Working and protection (W-P) paths",
author = "J{\'a}nos Tapolcai and Ho, {Pin Han}",
year = "2007",
month = "6",
language = "English",
volume = "9",
pages = "198--209",
journal = "Journal of Communications and Networks",
issn = "1229-2370",
publisher = "Korean Institute of Communication Sciences",
number = "2",

}

TY - JOUR

T1 - Dynamic survivable routing for shared segment protection

AU - Tapolcai, János

AU - Ho, Pin Han

PY - 2007/6

Y1 - 2007/6

N2 - This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

AB - This paper provides a thorough study on shared segment protection (SSP) for mesh communication networks in the complete routing information scenario, where the integer linear program (ILP) in [1] is extended such that the following two constraints are well addressed: (a) The restoration time constraint for each connection request, and (b) the switching/merging capacity constraint at each node. A novel approach, called SSP algorithm, is developed to reduce the extremely high computation complexity in solving the ILP formulation. Basically, our approach is to derive a good approximation on the parameters in the ILP by referring to the result of solving the corresponding shared path protection (SPP) problem. Thus, the design space can be significantly reduced by eliminating some edges in the graphs. We will show in the simulation that with our approach, the optimality can be achieved in most of the cases. To verify the proposed formulation and investigate the performance impairment in terms of average cost and success rate by the additional two constraints, extensive simulation work has been conducted on three network topologies, in which SPP and shared link protection (SLP) are implemented for comparison. We will demonstrate that the proposed SSP algorithm can effectively and efficiently solve the survivable routing problem with constraints on restoration time and switching/merging capability of each node. The comparison among the three protection types further verifies that SSP can yield significant advantages over SPP and SLP without taking much computation time.

KW - Complete routing information scenario

KW - Integer linear program (ILP)

KW - Shared risk group (SRG)

KW - Shared segment protection (SSP)

KW - Working and protection (W-P) paths

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

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

M3 - Article

VL - 9

SP - 198

EP - 209

JO - Journal of Communications and Networks

JF - Journal of Communications and Networks

SN - 1229-2370

IS - 2

ER -