An Efficient Fault Tolerance Model for Single and Multifault in MPLS Networks (original) (raw)
Related papers
Single Fault Tolerance Method for Protection Data Flow in the MPLS Network
Wireless Communication Technology, 2018
This paper presents efficient methods for rerouting traffic in the Multiprotocol Label Switching (MPLS) network, when a fault occurs in the working link. The proposed methods have been designed to handle single fault based on the protection switching and rerouting techniques. In this paper three algorithms are developed for fault recovery in the MPLS network based on ingress LSR, alert LSR and core LSR. The proposed methods have been simulated using the Network Simulator (NS2) and the simulation results show that the proposed methods significantly improve the network performance in comparison to similar existing methods.
Multiple Fault Tolerance in MPLS Network Using Open Source Network Simulator
2010
Multiprotocol Label Switching (MPLS) is a label based switching technique initiated by Internet Engineering Task Force to bring the speed of layer 2 switching to layer 3. Its label based switching technique allows routers to make the forwarding decision based on the contents of label instead of performing a complex route lookup table. Furthermore it allows explicit routing to overcome links and nodes failure in the network. For fault recovery multiprotocol label switching has two domains called Protection Switching and Rerouting. Explicit routing, in it the alternative paths are pre-established through MPLS core router (ingress node). We developed new protocol using explicit routing for multiple fault tolerance in the network. We simulate it in an open source network simulator ns2 and compare it with rerouting fault recovery protocol in NS that belongs to rerouting domain. The simulation shows that the proposed protection switching fault recovery protocol performed better in fault r...
Enhancing Fault Tolerance and Rerouting Strategies in Mpls Networks
Multi Protocol Label Switching (MPLS) has been used to provide traffic engineering and high speed networking. MPLS is an evolving network technology. MPLS is a framework which is introduced by IETF. It is a differentiated and scalable framework. MPLS delivers end-to-end IP services with the use of simple configuration and management. Fault tolerance is an important Quality Of Service factor. Fault tolerance needs to be considered to maintain network survivability. Fault tolerance is very important in every network system because it provides the facility to operate the network if any one or more parts of the system are damaged. The network devices are enabled by MPLS to specify path based on quality of service and bandwidth. The main use of MPLS technology is to speed up the network flow with the use of labels. Keyword:-MPLS, FEC(forward equivalence class), LSP
An Efficient Routing Method for Protection Data Flow in the MPLS Network
Journal of Science and Technology, 2017
This paper presents an efficient method for rerouting traffic in the Multiprotocol Label Switching (MPLS) network, when a fault occurs in the working link. The method has been designed to handle both single and multiple faults based on the protection switching and rerouting techniques. The proposed method leads to less packets loss, has better Packet Delivery Ratio (PDR), good throughput and eliminates packet disorder. The proposed method has been simulated using the Network Simulator (NS2) version 2.34 and the simulation results have shown that the proposed method significantly improves the network performance in comparison to similar existing methods.
A Hybrid Fault-Tolerant Algorithm for MPLS Networks
2008
In this paper we present a new fault tolerant, path maintaining, algorithm for use in MPLS based networks. The novelty of the algorithm lies upon the fact that it is the first to employ both path restoration mechanisms typically used in MPLS networks: protection switching and dynamic path rerouting. In addition, it is the first algorithm to adequately satisfy all four criteria which we consider very important for the performance of the restoration mechanisms in MPLS networks: fault recovery time, packet loss, packet reordering and tolerance of multiple faults. Simulation results indicate the performance advantages of the proposed hybrid algorithm (with respect to the four criteria), when compared with other algorithms that employ only one of the two restoration mechanisms.
An Efficient Rerouting Scheme for MPLS-Based Recovery and Its Performance Evaluation
Telecommunication Systems - TELSYS, 2002
The path recovery in MPLS is the technique to reroute traffic around a failure or congestion in a LSP. Currently, there are two kinds of model for path recovery: rerouting and protection switching. The existing schemes based on rerouting model have the disadvantage of more difficulty in handling node failures or concurrent node faults. Similarly, the existing schemes based on protection switching model have some difficulty in solving problem such as resource utilization and protection of recovery path. This paper proposes an efficient rerouting scheme to establish a LSP along the least-cost recovery path of all possible alternative paths that can be found on a working path, which is calculated by the upstream LSR that has detected a failure. The proposed scheme can increase resource utilization, establish a recovery path relatively fast, support almost all failure types such as link failures, node failures, failures on both a working path and its recovery path, and concurrent faults...
IJERT-Recovery from Link/Node Failure using MPLS and Tunnel
International Journal of Engineering Research and Technology (IJERT), 2014
https://www.ijert.org/recovery-from-linknode-failure-using-mpls-and-tunnel https://www.ijert.org/research/recovery-from-linknode-failure-using-mpls-and-tunnel-IJERTV3IS110620.pdf MPLS fast reroute (MPLS-FRR) mechanisms deviate the traffic in case of network failures. The Fast-reroute applications have been presents for Multiprotocol Label Switching (MPLS) networks to make it workable to fast reroute traffic locally in case of failure. The peak of this approach is that fast reroute a packet throughout the link. The Multiprotocol label switching (MPLS) packet forwarding based on some Constraint. Having identified a link/node failure in the MPLS, an alternate path must be found that push the packets from the source node to the destination node. This mechanism is known as fast rerouting and the procedure with the help of which the label switching path (LSP) is calculated before a failure occurs is known as fast reroute. By using this fault recovery technique we can make MPLS network is fault tolerant. Multiprotocol Label Switching (MPLS) fast reroute (FRR) can be defined by various methods, for example local repair and global repair. After reaching LER we don`t have to take reroute instead which a tunnel can be created to send the packets.
Lecture Notes in Computer Science, 2003
MPLS can be used to provide network robustness to faults through path protection techniques. In this paper we present a dynamic model supporting different classes of end-to-end protection, including protection against Single Fault and Dual Fault, with and without sharing of backup bandwidth. Beyond link and node failures we also consider protection against Shared Risk Link Group (SLRG) failure. An interesting feature of the proposed scheme is the ability to offer service differentiation with respect to the recovery probability, by coupling the differentiation on the number of backup paths with bandwidth assignment policy. In this paper we describe the underlying algorithms for route selection and backup bandwidth sharing. The route selection is based on explicit load-dependent routing of service and backup paths. We show by simulation that the proposed route selection algorithm is effective in improving the network utilization. We discuss two alternative implementations of our model: distributed and partially centralized. The primary concern with the distributed approach is the message overhead implied by link-load dissemination, e.g. by flooding. However we show by simulation that message overhead can be taken under control by adopting a well-tuned adaptive overhead reduction algorithm. Our conclusion is that both distributed and partially-centralized implementation are feasible.
Seamless Failure Recovery for Real-time Multimedia Applications in MPLS Networks
IPSJ Digital Courier, 2007
The QoS provided by current best effort Internet is not good enough for real-time multimedia applications that are categorized as premium traffic. It is believed that QoS guarantees could be better provided by the connection oriented networks. Multi Protocol Label Switching (MPLS) is one such technology and these connection oriented networks are inherently more prone to network failures. Rerouting is a solution to cope with them. However, the rerouting always causes packet losses and results in service outage. Therefore, the QoS of the real-time premium traffic is highly degraded. The seamless failure recovery proposed in this paper can be used for real-time premium traffic that needs a guaranteed QoS. It applies an FEC technique to the conventional rerouting based path protection and seamlessly recovers the packet losses due to rerouting by way of an FEC recovery technique. The numerical and simulation results show that the proposed method can provide network architecture without service outage for real-time premium traffic while minimizing the service costs such as redundant traffic and additional buffer at edge routers.
A survey of IP and multiprotocol label switching fast reroute schemes
Computer Networks, 2007
One of the desirable features of any network is its ability to keep services running despite a link or node failure. This ability is usually referred to as network resilience and has become a key demand from service providers. Resilient networks recover from a failure by repairing themselves automatically by diverting traffic from the failed part of the network to another portion of the network. This traffic diversion process should be fast enough to ensure that the interruption of service due to a link or node failure is either unnoticeable or as small as possible. The new path taken by a diverted traffic can be computed at the time a failure occurs through a procedure called rerouting. Alternatively the path can be computed before a failure occurs through a procedure called fast reroute. Much attention is currently being paid to fast reroute because service providers who are used to the 50-ms failure recovery time associated with SONET networks are demanding the same feature from IP and MPLS networks. While this requirement can easily be met in SONET because it operates at the physical layer, it is not easily met in IP and MPLS networks that operate above the physical layer. However, over the last few years, several schemes have been proposed for accomplishing 50-ms fast reroutes for IP and MPLS networks. The purpose of this paper is to provide a survey of the IP fast reroute and MPLS fast reroute schemes that have been proposed.