A rerouting scheme with dynamic control of restoration scope for survivable MPLS network

Authors:
Daniel Won-Kyu Hong;Choong Seon Hong
Affiliations:
Operations Support System Lab., KT, Daejeon, Korea;School of Electronics and Information, Kyung Hee Univerity, Gyeonggi, Korea
Venue:
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
Year:
2005

Citing 2
Cited 1

MPLS Restoration Scheme Using Least-Cost Based Dynamic Backup Path

ICN '01 Proceedings of the First International Conference on Networking-Part 2
Building reliable MPLS networks using a path protection mechanism

IEEE Communications Magazine

A hybrid fault-tolerant algorithm for MPLS networks

WWIC'08 Proceedings of the 6th international conference on Wired/wireless internet communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a rerouting scheme that can be applied to the restoration of working Label Switched Paths (LSPs) and preprovisioned backup LSPs, which consists of two subsequent algorithms. The first algorithm for the dynamic deterimination of the restoration scope (RS)increases the restoration speed by minimizing the complexity of the network topology and by maximizing the reusability of the existing working LSP. The second newly proposed concept of RS extension minimizes the probability of restoration failure by dynamically widening the restoration scope until the RS is equal to the whole network topology. Through simulation, we evaluate the performance of our restoration scheme and the existing protection schemes in terms of the restoration speed, packet loss, network resource utilization, and resource reusability of the existing working LSP.