A study on dynamic survivable routing with availability constraint for GMPLS-based recovery

Pin Han Ho, J. Tapolcai, Anwar Haque

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

Abstract

This paper introduces a new dynamic availability-aware survivable routing scheme under the framework of Generalized Multi-Protocol Label Switching (GMPLS) -based recovery, which aims to achieve the best generality for the network operation in meeting the end-to-end (E2E) availability requirement of each connection. The paper first defines the partial restorability, justifies the feasibility of equipping a connection with partial restorability under the GMPLS control plane, and highlights the approach of evaluating the E2E availability for a pair of working and partially restorative SRG (Shared Risk Group)-disjoint shared backup Label Switched Paths (LSPs). A compact matrix expression is developed for modeling the minimum spare capacity along each link and the cost function for solving both of the paths. Based on the developed cost function, a novel Integer Linear Program (ILP) is formulated to dynamically determine the working and backup LSPs of the corresponding connection request with the least amount of total capacity while the E2E availability requirement of the connection is met. We demonstrate that the model is general to the traffic uniformity, connection indivisibility, and working bandwidth restorability compared with the previous studies. Simulation is conducted to verify the proposed ILP model by making a comparison with a number of legacy schemes that achieve 100% restorability in facing a specific number of simultaneous failures, such as shared path protection (SPP), 1+1 protection, and dual-failure protection. In the case study, we have seen merits in the proposed algorithm by significantly reducing the required redundancy in the effort of achieving the given availability constraint for each connection request.

Original languageEnglish
Title of host publication2006 3rd International Conference on Broadband Communications, Networks and Systems, BROADNETS 2006
DOIs
Publication statusPublished - 2006
Event2006 3rd International Conference on Broadband Communications, Networks and Systems, BROADNETS 2006 - San Jose, CA, United States
Duration: Oct 1 2006Oct 5 2006

Other

Other2006 3rd International Conference on Broadband Communications, Networks and Systems, BROADNETS 2006
CountryUnited States
CitySan Jose, CA
Period10/1/0610/5/06

Fingerprint

Availability
Recovery
redundancy
costs
Cost functions
traffic
Labels
simulation
Group
Telecommunication traffic
Redundancy
multi-protocol label switching
Bandwidth

Keywords

  • Availability
  • Generalized Multi-Protocol Label Switching (GMPLS)
  • Partial restorable
  • Shared protection

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering
  • Communication

Cite this

Ho, P. H., Tapolcai, J., & Haque, A. (2006). A study on dynamic survivable routing with availability constraint for GMPLS-based recovery. In 2006 3rd International Conference on Broadband Communications, Networks and Systems, BROADNETS 2006 [4374350] https://doi.org/10.1109/BROADNETS.2006.4374350

A study on dynamic survivable routing with availability constraint for GMPLS-based recovery. / Ho, Pin Han; Tapolcai, J.; Haque, Anwar.

2006 3rd International Conference on Broadband Communications, Networks and Systems, BROADNETS 2006. 2006. 4374350.

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

Ho, PH, Tapolcai, J & Haque, A 2006, A study on dynamic survivable routing with availability constraint for GMPLS-based recovery. in 2006 3rd International Conference on Broadband Communications, Networks and Systems, BROADNETS 2006., 4374350, 2006 3rd International Conference on Broadband Communications, Networks and Systems, BROADNETS 2006, San Jose, CA, United States, 10/1/06. https://doi.org/10.1109/BROADNETS.2006.4374350
Ho PH, Tapolcai J, Haque A. A study on dynamic survivable routing with availability constraint for GMPLS-based recovery. In 2006 3rd International Conference on Broadband Communications, Networks and Systems, BROADNETS 2006. 2006. 4374350 https://doi.org/10.1109/BROADNETS.2006.4374350
Ho, Pin Han ; Tapolcai, J. ; Haque, Anwar. / A study on dynamic survivable routing with availability constraint for GMPLS-based recovery. 2006 3rd International Conference on Broadband Communications, Networks and Systems, BROADNETS 2006. 2006.
@inproceedings{429a9fb368a2438b996dda2b5d84c4d6,
title = "A study on dynamic survivable routing with availability constraint for GMPLS-based recovery",
abstract = "This paper introduces a new dynamic availability-aware survivable routing scheme under the framework of Generalized Multi-Protocol Label Switching (GMPLS) -based recovery, which aims to achieve the best generality for the network operation in meeting the end-to-end (E2E) availability requirement of each connection. The paper first defines the partial restorability, justifies the feasibility of equipping a connection with partial restorability under the GMPLS control plane, and highlights the approach of evaluating the E2E availability for a pair of working and partially restorative SRG (Shared Risk Group)-disjoint shared backup Label Switched Paths (LSPs). A compact matrix expression is developed for modeling the minimum spare capacity along each link and the cost function for solving both of the paths. Based on the developed cost function, a novel Integer Linear Program (ILP) is formulated to dynamically determine the working and backup LSPs of the corresponding connection request with the least amount of total capacity while the E2E availability requirement of the connection is met. We demonstrate that the model is general to the traffic uniformity, connection indivisibility, and working bandwidth restorability compared with the previous studies. Simulation is conducted to verify the proposed ILP model by making a comparison with a number of legacy schemes that achieve 100{\%} restorability in facing a specific number of simultaneous failures, such as shared path protection (SPP), 1+1 protection, and dual-failure protection. In the case study, we have seen merits in the proposed algorithm by significantly reducing the required redundancy in the effort of achieving the given availability constraint for each connection request.",
keywords = "Availability, Generalized Multi-Protocol Label Switching (GMPLS), Partial restorable, Shared protection",
author = "Ho, {Pin Han} and J. Tapolcai and Anwar Haque",
year = "2006",
doi = "10.1109/BROADNETS.2006.4374350",
language = "English",
isbn = "1424404258",
booktitle = "2006 3rd International Conference on Broadband Communications, Networks and Systems, BROADNETS 2006",

}

TY - GEN

T1 - A study on dynamic survivable routing with availability constraint for GMPLS-based recovery

AU - Ho, Pin Han

AU - Tapolcai, J.

AU - Haque, Anwar

PY - 2006

Y1 - 2006

N2 - This paper introduces a new dynamic availability-aware survivable routing scheme under the framework of Generalized Multi-Protocol Label Switching (GMPLS) -based recovery, which aims to achieve the best generality for the network operation in meeting the end-to-end (E2E) availability requirement of each connection. The paper first defines the partial restorability, justifies the feasibility of equipping a connection with partial restorability under the GMPLS control plane, and highlights the approach of evaluating the E2E availability for a pair of working and partially restorative SRG (Shared Risk Group)-disjoint shared backup Label Switched Paths (LSPs). A compact matrix expression is developed for modeling the minimum spare capacity along each link and the cost function for solving both of the paths. Based on the developed cost function, a novel Integer Linear Program (ILP) is formulated to dynamically determine the working and backup LSPs of the corresponding connection request with the least amount of total capacity while the E2E availability requirement of the connection is met. We demonstrate that the model is general to the traffic uniformity, connection indivisibility, and working bandwidth restorability compared with the previous studies. Simulation is conducted to verify the proposed ILP model by making a comparison with a number of legacy schemes that achieve 100% restorability in facing a specific number of simultaneous failures, such as shared path protection (SPP), 1+1 protection, and dual-failure protection. In the case study, we have seen merits in the proposed algorithm by significantly reducing the required redundancy in the effort of achieving the given availability constraint for each connection request.

AB - This paper introduces a new dynamic availability-aware survivable routing scheme under the framework of Generalized Multi-Protocol Label Switching (GMPLS) -based recovery, which aims to achieve the best generality for the network operation in meeting the end-to-end (E2E) availability requirement of each connection. The paper first defines the partial restorability, justifies the feasibility of equipping a connection with partial restorability under the GMPLS control plane, and highlights the approach of evaluating the E2E availability for a pair of working and partially restorative SRG (Shared Risk Group)-disjoint shared backup Label Switched Paths (LSPs). A compact matrix expression is developed for modeling the minimum spare capacity along each link and the cost function for solving both of the paths. Based on the developed cost function, a novel Integer Linear Program (ILP) is formulated to dynamically determine the working and backup LSPs of the corresponding connection request with the least amount of total capacity while the E2E availability requirement of the connection is met. We demonstrate that the model is general to the traffic uniformity, connection indivisibility, and working bandwidth restorability compared with the previous studies. Simulation is conducted to verify the proposed ILP model by making a comparison with a number of legacy schemes that achieve 100% restorability in facing a specific number of simultaneous failures, such as shared path protection (SPP), 1+1 protection, and dual-failure protection. In the case study, we have seen merits in the proposed algorithm by significantly reducing the required redundancy in the effort of achieving the given availability constraint for each connection request.

KW - Availability

KW - Generalized Multi-Protocol Label Switching (GMPLS)

KW - Partial restorable

KW - Shared protection

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

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

U2 - 10.1109/BROADNETS.2006.4374350

DO - 10.1109/BROADNETS.2006.4374350

M3 - Conference contribution

AN - SCOPUS:51749098268

SN - 1424404258

SN - 9781424404254

BT - 2006 3rd International Conference on Broadband Communications, Networks and Systems, BROADNETS 2006

ER -