Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Hierarchical Restoration Scheme for Multiple Failures in GMPLS Networks

Published

Author(s)

San-Nan K. Lee, C Kim, David W. Griffith

Abstract

It is expected that GMPLS-based recovery could become a viable option for obtaining faster restoration than layer 3 rerouting. Even though dedicated restoration ensures restorability of connections, exclusive use of dedicated scheme would result in wasting network resources, especially in case of providing for multiple failures. A range of restoration schemes has been proposed that use the concept of sharing capacity to improve efficiency. However, the case of multiple simultaneous failures has not been considered. In this paper we propose a hierarchical scheme for handling multiple simultaneous failures, where hierarchical Shared Risk Link Groups (SRLGs) are applied. We also introduce Backup Group Multiplexing (BGM) into our hierarchical scheme to precipitate the restoration of multiple Label Switched Paths (LSPs) with failures all at once. Furthermore, the proposed scheme selects a backup path with enough resources to satisfy renegotiated Quality of Service (QoS) of each backup group, among M backup paths. Our simulation results demonstrate that our scheme utilizes bandwidth more efficiently through multiplexing gain.
Proceedings Title
Proceedings of the 2003 International Conference on Communications
Conference Location
May 11-15
Conference Title
(Anchorage, AK)

Citation

Lee, S. , Kim, C. and Griffith, D. (2003), Hierarchical Restoration Scheme for Multiple Failures in GMPLS Networks, Proceedings of the 2003 International Conference on Communications, May 11-15, [online], https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=50723 (Accessed April 23, 2024)
Created April 30, 2003, Updated October 12, 2021