Routing with Partially Disjoint Shared Path (PDSP) protection

T. Cinkler, Diána Meskó, Gábor Viola, J. Tapolcai

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

Abstract

We propose two algorithms for dynamic routing of guaranteed bandwidth pipes with shared protection that provide low blocking through thrifty resource usage. We assume that a single working path can be protected by one or multiple protection paths, which are partially or fully disjoint from the working path. This allows better capacity re-use (i.e., better capacity sharing among protection paths). Furthermore, the resources used by the paths affected by the failure, can be also re-used. The significance of the proposed method "PDSP-LD" is that we consider the amount of shareable protection capacity of each link, while determining the protection path for all affected demands simultaneously. Therefore it gives optimal routing of shared protection paths in case of any single link failure! The obtained results can be used for routing with protection in SDH/SONET, ATM, MPLS, WR-DWDM (including ASTN/GMPLS) and other networks.

Original languageEnglish
Title of host publicationNGI 2005 - Next Generation Internet Networks: Traffic Engineering
Pages47-52
Number of pages6
Volume2005
DOIs
Publication statusPublished - 2005
EventNext Generation Internet Networks, NGI 2005 - Roma, Italy
Duration: Apr 18 2005Apr 20 2005

Other

OtherNext Generation Internet Networks, NGI 2005
CountryItaly
CityRoma
Period4/18/054/20/05

Fingerprint

Dense wavelength division multiplexing
Automatic teller machines
Pipe
Bandwidth

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Cinkler, T., Meskó, D., Viola, G., & Tapolcai, J. (2005). Routing with Partially Disjoint Shared Path (PDSP) protection. In NGI 2005 - Next Generation Internet Networks: Traffic Engineering (Vol. 2005, pp. 47-52). [1431646] https://doi.org/10.1109/NGI.2005.1431646

Routing with Partially Disjoint Shared Path (PDSP) protection. / Cinkler, T.; Meskó, Diána; Viola, Gábor; Tapolcai, J.

NGI 2005 - Next Generation Internet Networks: Traffic Engineering. Vol. 2005 2005. p. 47-52 1431646.

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

Cinkler, T, Meskó, D, Viola, G & Tapolcai, J 2005, Routing with Partially Disjoint Shared Path (PDSP) protection. in NGI 2005 - Next Generation Internet Networks: Traffic Engineering. vol. 2005, 1431646, pp. 47-52, Next Generation Internet Networks, NGI 2005, Roma, Italy, 4/18/05. https://doi.org/10.1109/NGI.2005.1431646
Cinkler T, Meskó D, Viola G, Tapolcai J. Routing with Partially Disjoint Shared Path (PDSP) protection. In NGI 2005 - Next Generation Internet Networks: Traffic Engineering. Vol. 2005. 2005. p. 47-52. 1431646 https://doi.org/10.1109/NGI.2005.1431646
Cinkler, T. ; Meskó, Diána ; Viola, Gábor ; Tapolcai, J. / Routing with Partially Disjoint Shared Path (PDSP) protection. NGI 2005 - Next Generation Internet Networks: Traffic Engineering. Vol. 2005 2005. pp. 47-52
@inproceedings{fedba9360ae8430b994c5e04a7681876,
title = "Routing with Partially Disjoint Shared Path (PDSP) protection",
abstract = "We propose two algorithms for dynamic routing of guaranteed bandwidth pipes with shared protection that provide low blocking through thrifty resource usage. We assume that a single working path can be protected by one or multiple protection paths, which are partially or fully disjoint from the working path. This allows better capacity re-use (i.e., better capacity sharing among protection paths). Furthermore, the resources used by the paths affected by the failure, can be also re-used. The significance of the proposed method {"}PDSP-LD{"} is that we consider the amount of shareable protection capacity of each link, while determining the protection path for all affected demands simultaneously. Therefore it gives optimal routing of shared protection paths in case of any single link failure! The obtained results can be used for routing with protection in SDH/SONET, ATM, MPLS, WR-DWDM (including ASTN/GMPLS) and other networks.",
author = "T. Cinkler and Di{\'a}na Mesk{\'o} and G{\'a}bor Viola and J. Tapolcai",
year = "2005",
doi = "10.1109/NGI.2005.1431646",
language = "English",
volume = "2005",
pages = "47--52",
booktitle = "NGI 2005 - Next Generation Internet Networks: Traffic Engineering",

}

TY - GEN

T1 - Routing with Partially Disjoint Shared Path (PDSP) protection

AU - Cinkler, T.

AU - Meskó, Diána

AU - Viola, Gábor

AU - Tapolcai, J.

PY - 2005

Y1 - 2005

N2 - We propose two algorithms for dynamic routing of guaranteed bandwidth pipes with shared protection that provide low blocking through thrifty resource usage. We assume that a single working path can be protected by one or multiple protection paths, which are partially or fully disjoint from the working path. This allows better capacity re-use (i.e., better capacity sharing among protection paths). Furthermore, the resources used by the paths affected by the failure, can be also re-used. The significance of the proposed method "PDSP-LD" is that we consider the amount of shareable protection capacity of each link, while determining the protection path for all affected demands simultaneously. Therefore it gives optimal routing of shared protection paths in case of any single link failure! The obtained results can be used for routing with protection in SDH/SONET, ATM, MPLS, WR-DWDM (including ASTN/GMPLS) and other networks.

AB - We propose two algorithms for dynamic routing of guaranteed bandwidth pipes with shared protection that provide low blocking through thrifty resource usage. We assume that a single working path can be protected by one or multiple protection paths, which are partially or fully disjoint from the working path. This allows better capacity re-use (i.e., better capacity sharing among protection paths). Furthermore, the resources used by the paths affected by the failure, can be also re-used. The significance of the proposed method "PDSP-LD" is that we consider the amount of shareable protection capacity of each link, while determining the protection path for all affected demands simultaneously. Therefore it gives optimal routing of shared protection paths in case of any single link failure! The obtained results can be used for routing with protection in SDH/SONET, ATM, MPLS, WR-DWDM (including ASTN/GMPLS) and other networks.

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

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

U2 - 10.1109/NGI.2005.1431646

DO - 10.1109/NGI.2005.1431646

M3 - Conference contribution

AN - SCOPUS:33744503426

VL - 2005

SP - 47

EP - 52

BT - NGI 2005 - Next Generation Internet Networks: Traffic Engineering

ER -