Fast restoration of resilience-guaranteed segments under multiple link failures in a general mesh-type MPLS/GMPLS network

Authors:
Jong-Tae Park;Min-Hee Kwon;Jung-Ho Kwon
Affiliations:
School of Electrical Engineering and Computer Science, Kyungpook National Univeristy, Daegu, Korea;School of Electrical Engineering and Computer Science, Kyungpook National Univeristy, Daegu, Korea;School of Electrical Engineering and Computer Science, Kyungpook National Univeristy, Daegu, Korea
Venue:
ICOIN'06 Proceedings of the 2006 international conference on Information Networking: advances in Data Communications and Wireless Networks
Year:
2006

Citing 5
Cited 1

Hierarchical Restoration Scheme for Multiple Failures in GMPLS Networks

ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
Generalized multiprotocol label switching: an overview of signaling enhancements and recovery techniques

IEEE Communications Magazine
Path vs. subpath vs. link restoration for fault management in IP-over-WDM networks: performance comparisons using GMPLS control signaling

IEEE Communications Magazine
Resilience in GMPLS path management: model and mechanism

IEEE Communications Magazine
Availability analysis of span-restorable mesh networks

IEEE Journal on Selected Areas in Communications

PCE-based hierarchical segment restoration

IM'09 Proceedings of the 11th IFIP/IEEE international conference on Symposium on Integrated Network Management

Quantified Score

Hi-index	0.00

Visualization

Abstract

Network resilience in MPLS/GMPLS networks has been receiving considerable attention Most of the previous research on GMPLS recovery management has focused on efficient routing or signaling methods from single failures Multiple simultaneous failures, however, may occur in a large-scale complex GMPLS network infrastructure In this article, we derived the condition to test the existence of backup segments which satisfy the resilience constraint under multiple link failures, in a general mesh-type MPLS/GMPLS network A decomposition theorem and a backup segment construction algorithm have been developed for the fast restoration of resilience-guaranteed backup segments, for the primary path with an arbitrary configuration Finally, the simulation has been to show the efficiency of the proposed approach.