Switching/merging node placement in survivable optical networks with SSP

J. Tapolcai, Pin Han Ho, Hsiang Fu Yu

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

Shared Segment Protection (SSP) has been proved to serve as a viable approach in achieving better flexibility and capacity efficiency than that by the conventional link and path shared protection. The superiority of SSP is nonetheless at the expense of taking more signaling efforts and requiring higher hardware precision in switching and merging restoration optical flows at core nodes. Therefore, the switching and merging capability of a network node is a kind of network resource that should be subject to manipulative planning. This paper investigates the performance impact by allocating the switching/merging (S/M) capable nodes in optical networks employing SSP. Two novel performance metrics, Average Increase in Blocking Probability (AIBP) and Average Increase of Total Cost (AITC), are devised to define the importance of being S/M capable for each node. A novel recursive algorithm is developed to evaluate the proposed performance metrics, in which both a brute force method and an enhanced method for reducing computation complexity are discussed. Simulation is conducted on two network topologies to verify the proposed approaches in evaluating the two performance metrics.

Original languageEnglish
Pages (from-to)381-389
Number of pages9
JournalComputer Communications
Volume33
Issue number3
DOIs
Publication statusPublished - Feb 26 2010

Fingerprint

Fiber optic networks
Merging
Blocking probability
Optical flows
Restoration
Topology
Hardware
Planning
Costs

Keywords

  • Protection domain
  • Shared Segment Protection (SSP)
  • Switching/merging (S/M)

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Switching/merging node placement in survivable optical networks with SSP. / Tapolcai, J.; Ho, Pin Han; Yu, Hsiang Fu.

In: Computer Communications, Vol. 33, No. 3, 26.02.2010, p. 381-389.

Research output: Contribution to journalArticle

Tapolcai, J. ; Ho, Pin Han ; Yu, Hsiang Fu. / Switching/merging node placement in survivable optical networks with SSP. In: Computer Communications. 2010 ; Vol. 33, No. 3. pp. 381-389.
@article{8f4e6406b4bb4c6f8957ea5638a8c16c,
title = "Switching/merging node placement in survivable optical networks with SSP",
abstract = "Shared Segment Protection (SSP) has been proved to serve as a viable approach in achieving better flexibility and capacity efficiency than that by the conventional link and path shared protection. The superiority of SSP is nonetheless at the expense of taking more signaling efforts and requiring higher hardware precision in switching and merging restoration optical flows at core nodes. Therefore, the switching and merging capability of a network node is a kind of network resource that should be subject to manipulative planning. This paper investigates the performance impact by allocating the switching/merging (S/M) capable nodes in optical networks employing SSP. Two novel performance metrics, Average Increase in Blocking Probability (AIBP) and Average Increase of Total Cost (AITC), are devised to define the importance of being S/M capable for each node. A novel recursive algorithm is developed to evaluate the proposed performance metrics, in which both a brute force method and an enhanced method for reducing computation complexity are discussed. Simulation is conducted on two network topologies to verify the proposed approaches in evaluating the two performance metrics.",
keywords = "Protection domain, Shared Segment Protection (SSP), Switching/merging (S/M)",
author = "J. Tapolcai and Ho, {Pin Han} and Yu, {Hsiang Fu}",
year = "2010",
month = "2",
day = "26",
doi = "10.1016/j.comcom.2009.10.007",
language = "English",
volume = "33",
pages = "381--389",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "3",

}

TY - JOUR

T1 - Switching/merging node placement in survivable optical networks with SSP

AU - Tapolcai, J.

AU - Ho, Pin Han

AU - Yu, Hsiang Fu

PY - 2010/2/26

Y1 - 2010/2/26

N2 - Shared Segment Protection (SSP) has been proved to serve as a viable approach in achieving better flexibility and capacity efficiency than that by the conventional link and path shared protection. The superiority of SSP is nonetheless at the expense of taking more signaling efforts and requiring higher hardware precision in switching and merging restoration optical flows at core nodes. Therefore, the switching and merging capability of a network node is a kind of network resource that should be subject to manipulative planning. This paper investigates the performance impact by allocating the switching/merging (S/M) capable nodes in optical networks employing SSP. Two novel performance metrics, Average Increase in Blocking Probability (AIBP) and Average Increase of Total Cost (AITC), are devised to define the importance of being S/M capable for each node. A novel recursive algorithm is developed to evaluate the proposed performance metrics, in which both a brute force method and an enhanced method for reducing computation complexity are discussed. Simulation is conducted on two network topologies to verify the proposed approaches in evaluating the two performance metrics.

AB - Shared Segment Protection (SSP) has been proved to serve as a viable approach in achieving better flexibility and capacity efficiency than that by the conventional link and path shared protection. The superiority of SSP is nonetheless at the expense of taking more signaling efforts and requiring higher hardware precision in switching and merging restoration optical flows at core nodes. Therefore, the switching and merging capability of a network node is a kind of network resource that should be subject to manipulative planning. This paper investigates the performance impact by allocating the switching/merging (S/M) capable nodes in optical networks employing SSP. Two novel performance metrics, Average Increase in Blocking Probability (AIBP) and Average Increase of Total Cost (AITC), are devised to define the importance of being S/M capable for each node. A novel recursive algorithm is developed to evaluate the proposed performance metrics, in which both a brute force method and an enhanced method for reducing computation complexity are discussed. Simulation is conducted on two network topologies to verify the proposed approaches in evaluating the two performance metrics.

KW - Protection domain

KW - Shared Segment Protection (SSP)

KW - Switching/merging (S/M)

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

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

U2 - 10.1016/j.comcom.2009.10.007

DO - 10.1016/j.comcom.2009.10.007

M3 - Article

AN - SCOPUS:74149090634

VL - 33

SP - 381

EP - 389

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 3

ER -