Paper Info
Title
A Segment-based Protection Scheme for MPLS Network Survivability.
Abstract
This paper proposes a new approach, segment-based path protection, which provides much more enhanced network resource utilization than the local protection scheme and achieves much more fast restoration than the global protection scheme. This segment-based protection scheme consists of two subsequent steps: determination of the optimal restoration scope taking the working path state, bandwidth, and delay constraints into account and calculation of optimal segmented backup path that is link and node disjoint path with the found working path. In addition, we evaluate the performance of proposed protection scheme under the randomly generated Waxman's network topology. With the advent of fiber and its increasing deployment in networks, the risk of losing huge volumes of data due to a span cut or node failure has escalated. Because of fierce competition among service providers and customers intolerance of disruption of service, survivability of a network has assumed great importance. Survivability refers to the ability of a network to provide continuity of service with no disruption, no matter how much the network may be damaged due to events such as fiber cable cuts or node failures due to equipment breakdown at a central office or other events such as fires, flooding, etc.). As a result, network designers are beginning to incorporate provisioning of services over disjoint paths, so that if one path fails due to a link or node failure, the second path can carry the traffic to its destination. This paper describes the construction of algorithms for finding the optimal disjoint paths between a given pair of nodes in an MPLS network. The key features of the algorithms will be optimality, since the aim is to reduce network costs. The algorithms will be applicable not only to the ideal graph- theoretic networks (described by nodes and links), but also to the more practical cases of networks described by nodes, links, and spans. Because of economic and practical considerations, spans, which are the actual physical connections in a network, can be shared by more than one link. Span-sharing complicates the network, and leads to network topologies not found or discussed in books. This paper will discuss such network topologies and special algorithms for finding disjoint paths in such networks. It will also discuss the construction of a survivable network design based on physical-disjointness, and basic network structures that permit such disjoint paths.
Year
DOI
Venue
2006
10.1109/NOMS.2006.1687672
NOMS
Keywords
Field
DocType
network topology,service provider,computer networks,network design,mpls,resource management,resource utilization,bandwidth,multiprotocol label switching
Resource management,Backup path,Survivability,Multiprotocol Label Switching,Computer science,Computer network,Network topology,Bandwidth (signal processing),Disjoint path,Path protection,Distributed computing
Conference
ISSN
ISBN
Citations 
1542-1201
1-4244-0142-9
0
PageRank 
References 
Authors
0.34
4
3
Name
Order
Citations
PageRank
Daniel W. Hong121.70
Choong Seon Hong22044277.88
Woo-Sung Kim34910.70