Link Failure Recovery Research Articles

FRRL: A reinforcement learning approach for link failure recovery in a hybrid SDN

FRRL: A reinforcement learning approach for link failure recovery in a hybrid SDN

FAPR: An Adaptive Approach to Link Failure Recovery in SDN with High Speed and Low Interruption Rate

FAPR: An Adaptive Approach to Link Failure Recovery in SDN with High Speed and Low Interruption Rate

Quantitative measurement of link failure reaction time for devices with P4-programmable data planes

Quick handling of link failures remains a challenging issue in current communication networks, although it is crucial to many routing algorithms. Link failures are the leading cause of packet losses and delays, therefore, failure recovery is tied to stringent requirements for certain services, such as the sub-50 millisecond completion time for carrier-grade networks, which is sometimes difficult to achieve in traditional routing schemes. For this reason, fast recovery strategies are key pillars of modern communication networks. In this paper, we demonstrate the benefits of the devices with Programmable Data Planes (PDP) for fast reacting to link failures. We first review the link failure detection, reaction and recovery procedures and then we discuss the main fast failure recovery mechanisms employed by different types of devices in current communication networks. In addition, we present a novel method to measure the link failure reaction time of an Intel Tofino switch with PDP, as well as the results obtained when measuring such time using real hardware equipment. Our results show that such hardware devices provide a failure reaction time in the order of microseconds, with an average of 472.88μ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\upmu $$\\end{document}s, which poses PDP as a key technology to achieve zero packet loss and zero delay failure recovery.

Protection Techniques using Resource Delayed Release for SDN-based OTN over WDM Networks

The availability and reliability of optical backbone links are very important to ensure the efficient operation of the Internet. To address the issue of data loss due to optical link failures, there is a need for an optimal recovery strategy so that the traffic can be rerouted on a backup path to the destination. This paper builds on top of our prior research efforts (Yavary Mehr et al., 2022; Zhou et al., 2017) which introduced the concept of Resource Delayed Release (RDR) by adding a new state called ”idle state” which begins when the channel has completed carrying its services so that the next request can be carried immediately instead of waiting for a new channel to be established. While RDR improves the network performance by reducing the service provisioning time and blocking probability, it does not handle link failures which are quite common in optical networks. Therefore, enhancing RDR with protection strategies will make the network more reliable and thus we investigate this topic in this work.In this paper, we evaluate four different protection methods for single link failure recovery in WDM networks (Path Protection (PP), Partial Path Protection (PPP), Segment Protection (SegP) and Link Protection (LP)) with two different routing approaches namely Shortest Path (SPath) and Greedy (G) algorithm under uniform and non-uniform traffic generated using real traffic traces collected from a local Internet Service Provider (ISP). Special attention while evaluating these protection strategies was paid to the optimization of the amount of remaining bandwidth. The performance evaluation of the network under uniform and non-uniform traffic was done over the NSFNet and COST239 topologies by employing the metrics of link and network utilization, Blocking Probability (BP), Bandwidth Blocking Probability (BBP), Recovery Time (RT) and Service Provisioning Time (SPT). Our results show that the PPP method performs the best in terms of reducing BP, BBP, and SPT compared with PP, LP, and SegP in all three topologies while utilizing RDR.

Proposed enhanced link failure rerouting mechanism for software-defined exchange point

Internet eXchange point (IXP) is a way to optimize network bandwidth. It enables a platform in the different providers like internet service providers (ISPs) and content delivery providers (CDNs) to share their traffic through a common point. A software defined exchange point (SDX) is an IXP comprising of a programmable deployed software defined network (SDN) switching fabric to enhance the management of their services, but they met the performance issues. The previous studies proposed various mechanisms and frameworks that tackled with these issues, but they don’t overcome overall challenges like link failure recovery for multi-hop-based SDX particularly packet processing delay and switch memory overhead. To cope with these issues, this paper proposed an enhanced link failure rerouting (ELFR) mechanism for multi-hop-based SDX. The objective of the proposed ELFR mechanism is to reduce the delay of packet processing to recover the link failure quickly and improve the path computation while ensuring the switch storage overhead. The present paper is an effort to retrospect and analyze the critical review of existing work for SDX. Furthermore, this paper provides a background of SDX, its components and its applications. Finally, this paper presents and compares the expected results of ELFR mechanism and related work.

Reliably Route IoT Packets in Software Defined mmWave Mesh Networks

Although millimeter wave (mmWave) mesh networks provide large bandwidth to deliver IoT packets, link failure caused by non-light-of-sight (NLoS) condition degrades network reliability. With the assistance of software defined networking (SDN), we propose a Fast link failure Recovery Routing (FastReRoute) framework to instantly re-route packets from the failed links to another ones minimizing packet loss. Upon a link fails, FastReRoute first re-routes packets via the pre-configured local backup path. FastReRoute conditionally re-routes packets again according to the management using the SDN controller. We integrate FastReRoute into Mininet for performance evaluation. This demonstrates FastReRoute effectively sustains the network reliability.

Reliable Failure Restoration with Bayesian Congestion Aware for Software Defined Networks

Software Defined Networks (SDN) introduced better network management by decoupling control and data plane. However, communication reliability is the desired property in computer networks. The frequency of communication link failure degrades network performance, and service disruptions are likely to occur. Emerging network applications, such as delay-sensitive applications, suffer packet loss with higher Round Trip Time (RTT). Several failure recovery schemes have been proposed to address link failure recovery issues in SDN. However, these schemes have various weaknesses, which may not always guarantee service availability. Communication paths differ in their roles; some paths are critical because of the higher frequency usage. Other paths frequently share links between primary and backup. Rerouting the affected flows after failure occurrences without investigating the path roles can lead to post-recovery congestion with packet loss and system throughput. Therefore, there is a lack of studies to incorporate path criticality and residual path capacity to reroute the affected flows in case of link failure. This paper proposed Reliable Failure Restoration with Congestion Aware for SDN to select the reliable backup path that decreases packet loss and RTT, increasing network throughput while minimizing post-recovery congestion. The affected flows are redirected through a path with minimal risk of failure, while Bayesian probability is used to predict post-recovery congestion. Both the former and latter path with a minimal score is chosen. The simulation results improved throughput by (45%), reduced packet losses (87%), and lowered RTT (89%) compared to benchmarking works.

Reliable Multipath Flow for Link Failure Recovery in 5G Networks Using SDN Paradigm

In modern networks and cloud evolution, as new nodes to internetwork growing rapidly and use of gaming and video streaming over the network require high availability with very small latency rate. 5G networks provides muchfaster services than 4G but link failure occurrence can affect the quality of service. In 5G networks environmentalfactors also affect the efficiency of wireless signals. To overcome such type of issues, base stations are placed indistributed manner around urban areaswhen decision is required for the placement. However, in some scenarioswe can have few similarities, as in general, highways are same. In existed systems signals distribution is performedhomogenously, so it will be generating issues like fractal and environmental. It will be cause of great economicloss. However, being an emerging network paradigm, Software defined Network (SDN) is easy to manage due tological separation of control plane and data plane. SDN supports numerous advantages, one of them is link robustness to avoid service unavailability. To cope with network link failures there are many mechanisms existedlike proactive and reactive mechanisms, but these mechanisms calculate multiple paths and stored in flow tableswithout considering reliability of link. Therefore, it will be cause of high latency rate due to calculation of manymultiple paths and increased traffic overhead too. To overcome these issues, we proposed a new approach in whichmultipath numbers depend on reliability of primary path. Number of alternative paths decreased as reliability oflink increased it leads to less time required to calculate alternative path. In addition, traffic overhead decreases ascompared to existing approaches. Secondly, we also integrate the shortest distance factor with reliability factor,and we get better results than existing approaches. Our proposed system will be helpful in increasing the availability of services in 5G network due to low latency rate and small traffic overhead required in link failure recovery

A Secured and Reliable Route Maintenance Mechanism for AODV Routing Protocol

Link failure between the nodes takes place due to reasons like channel interference and dynamic obstacles in mobile Ad Hoc networks, that give rise to severe performance degradation. In traditional AODV, the link failure is overcome by re-routing from the source node which is considered to be a time consuming process that increases the overhead of the nodes. Also, in case of multiple link failures, there are chances for loss of data packets. The performance of the network during link failure has to be maintained dynamically in circumstances such as long data transfer such as a stream of voice data which is an underlying challenge. Another challenging problem is to feasibly detect and defend possible attacks during data transmission. In order to overcome these performance related issues, we developed the Secured Local Link Failure Recovery Algorithm (SLLFR) for Adhoc networks that establishes recovery from link failures spontaneously at the point of link breakage. In such cases, a reliable link failure recovery is the main criteria that will determine the performance of the network in terms of quality of service (QoS). The SLLFR is deployed in each node collects RREP in the RREP Buffer Table (RBT) stack in the highest order of signal strength, which gets triggered during link failures. Once a link failure is detected, the intermediate node searches for an alternate path around the faulty area by choosing the first RREP that is stacked in the RBT and establishes a new route to the intended destination for sending the data packets without any time delay. The simulation results show that the performance parameters like packet delivery ratio, throughput, average end to end delay and routing overhead are better compared to the traditional AODV and other link failure recovery techniques.

P4Neighbor: Efficient Link Failure Recovery With Programmable Switches

Programmable data plane hardware creates a possibility to solve network-related problems. Ensuring fault tolerance of link failures is a fundamental network issue. Link failure recovery mechanisms are widely used in traditional and software-defined networks. The proactive failure recovery mechanism usually requires a backup path to be installed in the switch in advance. When the link fails, the switch can quickly switch to the backup path to continue sending packets. However, storing a large number of backup paths consumes a lot of switch storage. In this article, we analyze why implementing traditional proactive failure recovery mechanism introduces huge switch storage overhead, and discuss the flexibility and limitations of the programmable data plane. Then, we present P4Neighbor, a proactive link failure recovery framework based on the programmable data plane. P4Neighbor encapsulates backup paths into the header of a packet when a link failed and leverages this information to achieve link failure recovery. By storing only the backup paths of the neighbor switches, P4Neighbor requires little switch storage to store backup paths. Besides, P4Neighbor also takes complex link failure situations into consideration, which makes the network's fault tolerance slightly increase. Experimental results show that compared with the traditional failure recovery mechanism, P4Neighbor achieves a reduction rate of 57.9%-84.5% in terms of stored switch entries. Meanwhile, P4Neighbor also has a higher failure recovery ratio than traditional proactive link failure recovery mechanisms.

CDRA: A Community Detection based Routing Algorithm for Link Failure Recovery in Software Defined Networks

The increase in size and complexity of the Internet has led to the introduction of Software Defined Networking (SDN). SDN is a new networking paradigm that breaks the limitations of traditional IP networks and upgrades the current network infrastructures. However, like traditional IP networks, network failures may also occur in SDN. Multiple research studies have discussed this problem by using a variety of techniques. Among them is the use of the community detection method is one of the failure recovery technique for SDN. However, this technique have not considered the specific problem of multiple link multi-community failure and inter-community link failure scenarios. This paper presents a community detection-based routing algorithm (CDRA) for link failure recovery in SDN. The proposed CDRA scheme is efficient to deal with single link intra-community failure scenarios and multiple link multi-community failure scenarios and is also able to handle the inter-community link failure scenarios in SDN. Extensive simulations are performed to evaluate the performance of the proposed CDRA scheme. The simulation results depicts that the proposed CDRA scheme have better simulations results and reduce average round trip time by 35.73%, avg data packet loss by 1.26% and average end to end delay 49.3% than the Dijkstra based general recovery algorithm and also can be used on a large scale network platform.

Link failure recovery using p-cycles in wavelength division multiplex (WDM) mesh networks

Abstract Network survivability has become a crucial requirement in all types of computer networks. It becomes even more significant for wavelength division multiplex (WDM) mesh networks due to their high speed and capacity. These networks are prone to link failures. A link failure may be a single or multiple link failure. A single-link failure is easy to locate and fix as compared to multiple link failures. A dual-link failure recovery technique has been proposed using p-cycles. This technique uses a replication method for the p-cycle circle. It is an enhancement of the original failure independent path protection p-cycle scheme. The replica properties of p-cycle have been used to protect the nodes through the same p-cycle available. Creating a new p-cycle always adds to the cost of the network, whereas using a replica of already existing p-cycle significantly reduces the network cost. The proposed technique is implemented using network simulator in three phases.

Link Failure Recovery Mechanism in Software Defined Networks

In traditional networks, the pre-routed packets are dropped during the link failure leading to a huge data loss. Survivability techniques such as protection and restoration are available to provide the solution before and after the link failure. But, the new flow entries that are to be added in the flow table increase the initial network demand leading to an increase in memory demand per switch. The saved data not only reduces the network speed but also demands of repeated processing of entries. In this paper, we propose a new scheme of Group Table based Rerouting (GTR) technique to find the response against single link failure through Fast Fail-over (FF) group table feature provided by OpenFlow. This scheme provides equal roles for both controllers and forwarding OpenFlow enabled switches. Here, the controller maintains a look-up table which is updated periodically according to the change in network structure. Also, it has to update the FF group table simultaneously corresponding to every active port of the switches. The controller relabels the packets and updates the flow entries on respective switches.

On spectrum and energy efficient survivable multipath routing in off-line Elastic Optical Network

In this paper, we propose a novel integrated approach for designing survivable off-line Elastic Optical Network (EON) to minimize energy consumption and spectrum requirement. Single link failure recovery is ensured by applying multipath based routing and spectrum allocation (RSA). The RSA problem to minimize spectrum utilization is a NP-Hard one. Integer Linear Programming model is formulated for survivable multipath RSA (SM-ILP) to obtain the optimal solution for a small sized network. As the solution of SM-ILP gets intractable with the growth of the network size, two heuristics based on Greedy Algorithm (SM-GR) and Genetic Algorithm (SM-GA) are also developed to obtain near optimal solution for large-sized networks. Simulation studies have been carried out to evaluate the performance of the heuristics, and the results are compared with that obtained by solving the ILP formulation for small problem size. It is observed that for the considered simulation set up, proposed heuristics provide solution with variation of at most 6.77% for energy consumption and 3.71% for spectrum utilization to the optimal solution. Execution of those heuristics with different parameters on two large-sized networks NSFNET and COST-239 reveals that SM-GA outperforms SM-GR while aiming to minimize spectrum and power consumption jointly as well as spectrum utilization only whereas SM-GR performs better than SM-GA while minimizing power consumption only.

Software-Defined Networking Approaches for Link Failure Recovery: A Survey

Deployment of new optimized routing rules on routers are challenging, owing to the tight coupling of the data and control planes and a lack of global topological information. Due to the distributed nature of the traditional classical internet protocol networks, the routing rules and policies are disseminated in a decentralized manner, which causes looping issues during link failure. Software-defined networking (SDN) provides programmability to the network from a central point. Consequently, the nodes or data plane devices in SDN only forward packets and the complexity of the control plane is handed over to the controller. Therefore, the controller installs the rules and policies from a central location. Due to the central control, link failure identification and restoration becomes pliable because the controller has information about the global network topology. Similarly, new optimized rules for link recovery can be deployed from the central point. Herein, we review several schemes for link failure recovery by leveraging SDN while delineating the cons of traditional networking. We also investigate the open research questions posed due to the SDN architecture. This paper also analyzes the proactive and reactive schemes in SDN using the OpenDayLight controller and Mininet, with the simulation of application scenarios from the tactical and data center networks.

A Reconfigurable Multicast Routing Protocol for Mobile Ad-Hoc Networks

An infrastructure independent and self-organizing network where the mobile nodes are communicated with each other through wireless links is referred asMobile ad-hoc network. Amajor challenging task of mobile ad-hoc networks is Route maintenance due to some reasons such as frequent topological changes, packet collisions and bad channels which may cause some link breakages. Reconfigurable Virtual Backbone (RVB) construction and maintenance play a vital role, mainly in the multicast routing of mobile ad-hoc networks (MANETs). In this paper, the issues in providing a reconfigurable virtual backbone with the lower overhead are investigated and here we come up with a solution and propose a Reconfigurable Multicast Routing Protocol (RMRP) for constructing a virtual backbone and generating an alternate path during link failures. In comparison with the existing backbone and link recovery protocols like Backbone Group Model (BGM), Hierarchical Virtual Backbone Construction (HVBC) protocol and Local Link Failure Recovery (LLFR) protocol, the proposed protocol yields effective results in constructing a reconfigurable virtual backbone and generating an on-demand alternate path with the minimized overhead, increasing packet delivery ratio, throughput, minimizing delay of transmission, energy consumption, and with the improved routing performance significantly.

Fault-Tolerant Session Support for Service-Centric Networking

Service-Centric Networking (SCN) is a Future Internet architecture extending ICN with support for services, in which addressing and routing centers around services. SCN provides session support, however, recovery mechanisms do not exist in SCN session management. Therefore, SCN sessions suffer from link and node failures. In this paper, we present the design, implementation, and evaluation of three link failure recovery techniques for sessions in SCN. The first mechanism is based upon propagating session identifiers within the network using Bloom filters, the second design is based upon the propagation of service provider identifiers, and the third design uses piggybacking for the propagation of service provider identifiers.

CFR: A cooperative link failure recovery scheme in software‐defined networks

SummarySoftware‐defined networking that separates the control plane from the data plane is envisioned as a promising technology to enable resilient and flexible network management. Tolerating link failures is a fundamental problem in enhancing such network resilience in software‐defined networking. Reactive and proactive fault tolerant schemes for conventional networks may not well balance the fault recovery time and network performance, since the proactive scheme typically underutilizes resources and the reactive scheme usually incurs a longer recovery time. In this paper, we propose a cooperative link failure recovery scheme to find a fine‐grained trade‐off between resource utilization and recovery time by combining reactive and proactive methods. We formalize the problem of link failure recovery as a multiobjective optimization problem and devise a 2‐stage algorithm for it. The first stage of the algorithm guarantees connectivity restoration in an acceptable recovery interval based on fast failover feature supported in OpenFlow protocol, meanwhile it assigns virtual local area network tags to back up paths for achieving a lower memory consumption. The second stage of the algorithm guarantees the quality of service for different applications by adjusting the backup paths after rapid connectivity restoration. Extensive simulations highlight that cooperative link failure recovery scheme can satisfy both the carrier‐grade recovery requirements and quality of service requirements in terms of delay and network bandwidth.

Efficient and Consistent Flow Update for Software Defined Networks

Software defined network (SDN) provides flexible and scalable routing by separating control plane and data plane. With centralized control, SDN has been widely used in traffic engineering, link failure recovery, and load balancing. This work considers the flow update problem, where a set of flows need to be migrated or rearranged due to change of network status. During flow update, efficiency and consistency are two main challenges. Efficiency refers to how fast these updates are completed, while consistency refers to prevention of blackholes , loops , and network congestions during updates. This paper proposes a scheme that maintains all these properties. It works in four phases. The first phase partitions flows into shorter routing segments to increase update parallelism. The second phase generates a global dependency graph of these segments to be updated. The third phase conducts actual updates and then adjusts dependency graphs accordingly. The last phase deals with deadlocks, if any, and then loops back to phase three if necessary. Through simulations, we validate that our scheme not only ensures freedom of blackholes, loops, congestions, and deadlocks during flow updates, but is also faster than existing schemes.

Link Failure Recovery in SDN: High Efficiency, Strong Scalability and Wide Applicability

Link failures are commonly observed in computer networks, including the newly emerging Software Defined Network (SDN). Considering that failure recovery methods used in traditional networks cannot be applied to SDN networks directly, we propose a method named pro-VLAN in this paper, which calculates a backup path and assigns a unique VLAN id for each link of the network based on the protection mechanism. It makes the most of SDN’s features and can recover a single link failure in SDN with the advantages of high efficiency, strong scalability and wide applicability. More specifically, high efficiency (i.e., a fast failure recovery with a low memory consumption) is achieved by calculating backup paths for each link instead of each flow and using group tables to switch backup paths automatically and locally when failures occur. Strong scalability (i.e., the amount of backup flow entries per switch is stable) is achieved by keeping the amount of links per switch no matter how the network scale extends or how the amount of flows increases. Wide applicability is achieved by always finding a path available without modifying any hardware or protocol as long as the network is still reachable after a link failure. Simulation results and mathematical analysis demonstrate that both pro-VLAN and a flow-based protection method achieve a fast failure recovery, while pro-VLAN consumes less than 1% of the forwarding entries to store backup paths as compared to the flow-based method. Moreover, when the network scale increases from 10 to 60 switches by 500%, the increase of the number of backup flow entries per switch built by pro-VLAN is only less than 50%.