IJERT-Recovery from Link/Node Failure using MPLS and Tunnel (original) (raw)

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

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...

An Efficient Fault Tolerance Model for Single and Multifault in MPLS Networks

International Journal of Software Engineering and Computer Systems, 2019

The ever increasing demands for the performance improvement in Multiprotocol Label Switching (MPLS) network have motivated to develop a resistant MPLS network to the failures at link, node and software of the MPLS network devices. The occurrence fault at link degrades the network performance due to data packets loss. This paper proposes an efficient model for rerouting traffic in MPLS network when a single and multi-fault occur in working link based on the protection switching and rerouting algorithms. In this model three algorithms are developed for fast fault recovery in MPLS network based on ingress LSR, alert LSR and core LSR. The proposed model has been simulated using Network Simulator (NS2) version 2.34, simulation results show that the proposed model significantly improves the network performance such that eliminates packet disorder, reduces the packets loss, get better PDR, decreases end to end delay and enhance throughput. The proposed model has less space complexity compared to other methods that reached to 13.33% in single fault and 33.33% in multi-fault and has a fast recovery time compared to other methods.

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.

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.

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...

Failure inferencing based fast rerouting for handling transient link and node failures

Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies.

With the emergence of Voice over IP and other real-time business applications, there is a growing demand for an IP network with high service availability. Unfortunately, in today's Internet, transient failures occur frequently due to faulty interfaces, router crashes, etc., and current IP networks lack the resiliency needed to provide high availability. To enhance availability, we proposed failure inferencing based fast rerouting (FIFR) approach that exploits the existence of a forwarding table per linecard, for lookup efficiency in current routers, to provide fast rerouting similar to MPLS, while adhering to the destination-based forwarding paradigm. In our previous work, we have shown that the FIFR approach can deal with single link failures. In this paper, we extend the FIFR approach to ensure loop-free packet delivery in case of single router failures also, thus mitigating the impact of many scenarios of failures. We demonstrate that the proposed approach not only provides high service availability but also incurs minimal routing overhead.

A SURVEY ON MULTIPLE ROUTING CONFIGURATIONS AGAINST NODE AND LINK FAILURES

As the Internet takes an increasingly central role in our communications infrastructure; the slow convergence of routing protocols after a network failure becomes a growing problem. Internet plays a vital role in our day to day activities such as online banking, online shopping, online transactions and some other type of communications infrastructure; due to slow convergence of routing protocols after network failure becomes the massive problem for communication network. A recovery technique name Multiple Routing Configurations (MRC) is used to guarantee fast recovery from link and node failure in networks. In the communication network if the communication is done from the different nodes to transfer the data from source node to destination node, if the communication nodes are damaged or the communication link is broken due to some interference, then network stop and data may lost in this process. So recovery of the data from the network and keep the network functional even if the nodes in the network are failed is the most important for the communication network. So in this paper a detail review on multiple routing configurations (MRC) is done.

IJERT-A Localized on-Demand Link State Routing for Handling Multiple Failures in IP Networks.

International Journal of Engineering Research and Technology (IJERT), 2014

https://www.ijert.org/a-localized-on-demand-link-state-routing-for-handling-multiple-failures-in-ip-networks https://www.ijert.org/research/a-localized-on-demand-link-state-routing-for-handling-multiple-failures-in-ip-networks-IJERTV3IS10675.pdf We observe that there is failure in an IP network and these failures are common which may creat an obstacle. A localized on demand link state routing is used in such a case to make the failure chances negligible. We here use Greedy Forwarding and Blacklist based forwarding algorithm for handling such a failure within our IP network. Greedy based uses a weight based distribution which find out efficient path and then work along with the blacklist to get most efficient path during packet forwarding. LOLS i.e. localized on demand link state routing make it to work on multiple failures thus we can handle multiple failures within a network. This paper elaborates how it implements to assure forwarding to all reachable destinations in case of any two link failure. LOLS, each packet has a blacklist, which has a set of failed links along its path, and the next hop is determined by eliminating the blacklisted links. We also used Multiple Routing Configuration Protocol in a purpose for faster rerouting and thus it works more efficiently into a network. The evaluation of such failure scenario dependent on various real network topologies that reveals LOLS requires 6 bits in the worst case to convey the blacklisted information. We argue that the overhead is acceptable considering the LOLS routing deviates from the optimal path.