Evaluating the Fast Rerouting with MPLS Networks as a Fault Tolerance Mechanism with OSPF and IS-IS routing protocols (original) (raw)
Related papers
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
Effects of Rerouting After Service Disruption in MPLS based networks
2006
This paper considers the effects of dynamic restoration routing after a failure in MPLS based networks. MPLS technology enables scalable VPNs and end-to-end QoS over the Internet which requires efficient fault recovery in presence of link or node failures. A major factor on network performance after a failure is the transient congestion that results from restored connections trying to retransmit packets lost since the failure. We focus on the importance of appropriate selection of a rerouting algorithm to control the transient congestion, and we present results from a simulation-based performance study of several routing algorithms. The results show that proper selection of fault recovery routing algorithm can improve MPLS-network performance after a failure.
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...
Fast Emergency Paths Schema to Overcome Transient Link Failures in OSPF Routing
International journal of Computer Networks & Communications, 2012
A reliable network infrastructure must be able to sustain traffic flows, even when a failure occurs and changes the network topology. During the occurrence of a failure, routing protocols, like OSPF, take from hundreds of milliseconds to various seconds in order to converge. During this convergence period, packets might traverse a longer path or even a loop. An even worse transient behaviour is that packets are dropped even though destinations are reachable. In this context, this paper describes a proactive fast rerouting approach, named Fast Emergency Paths Schema (FEP-S), to overcome problems originating from transient link failures in OSPF routing. Extensive experiments were done using several network topologies with different dimensionality degrees. Results show that the recovery paths, obtained by FEP-S, are shorter than those from other rerouting approaches and can improve the network reliability by reducing the packet loss rate during the routing protocols convergence caused by a failure.
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.
Deterministic Routing in OSPF for Post Single Link Failure
2014
In the Internet, link-state routing protocols, that are commonly deployed tend to converge globally after any of real-time applications. Topological change in the network i.e. news of the change is propagated to all the routers in the network. Such network-wide protocol convergence introduces transient inconsistency in the routing tables of the routers in the network. This inconsistency of routing tables may lead to the formation loops in the network. Study shows that such loops cause a significant packet forwarding discontinuity in the network and severely affects performance In this paper a technique to handle transient Convergence is initiated only for long-lasting failures in the network. single link failures in OSPF networks, without initiating global IP convergence process. Our technique is based on adding information in the packets traversing the failure by the routers attached to the failed link, and then locally rerouting them
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.
An extended fault-tolerant link-state routing protocol in the internet
IEEE Transactions on Computers, 2003
Link-state routing protocols, such as OSPF and IS-IS, are widely used in the Internet today. In link-state routing protocols, global network topology information is first collected at each node. A shortest path tree (SPT) is then constructed by applying Dijkstra's shortest path algorithm at each node. Link-state protocols usually require the flooding of new information to the entire (sub)network after changes in any link state (including link faults). Narvaez et al. proposed a fault-tolerant link-state routing protocol without flooding. The idea is to construct a shortest restoration path for each unidirectional link fault. Faulty link information is distributed only to the nodes in the restoration path and only one restoration path is constructed. It is shown that this approach is loop-free. However, the Narvaez et al. approach is inefficient when a link failure is bidirectional because a restoration path is unidirectional and routing tables of nodes in the path are partially updated. In addition, two restoration paths may be generated for each bidirectional link fault. In this paper, we extend the Narvaez et al. protocol to efficiently handle a bidirectional link fault by making the restoration path bidirectional. Several desirable properties of the proposed extended routing protocol are also explored. A simulation study is conducted to compare the traditional link-state protocol, the source-tree protocol, the Narvaez et al. unidirectional restoration path protocol, and the proposed bidirectional restoration path protocol.
International Journal of Computer & Organization Trends
In this paper an attempt has been made to analyze the steady state behavior of RIP and OSPF routing protocols for WAN in terms of convergence duration with respect to simulation time in the context of link failure and recovery using OPNET simulator. The time that is required for the network to converge is referred to as convergence duration. Convergence is one of the key factors that determine the performance of the routing protocol. From the experimental results we found that convergence activity and convergence duration is maximum for OSPF and minimum for RIP.