Finding the Optimal Shortest Path Tree with Respect to Single Link Failure Recovery

2008 ◽  
Author(s):  
Yueping Li ◽  
Zhe Nie ◽  
Xiaohong Zhou
Keyword(s):  
Shortest Path ◽  
Failure Recovery ◽  
Link Failure ◽  
Shortest Path Tree ◽  
Single Link

Shortest Path Tree with Embedded Backups-an Exhaustive Link Failure Recovery Algorithm

2011 ◽  
Vol 4 (2) ◽  
pp. 143-155
Author(s):  
Muhammad Aasim Qureshi ◽  
Mohd Fadzil Hassan ◽  
Rabia Sammi ◽  
Sohail Safdar ◽  
Rehan Akbar
Keyword(s):  
Shortest Path ◽  
Failure Recovery ◽  
Link Failure ◽  
Shortest Path Tree ◽  
Recovery Algorithm

A Framework to Recover Single Link Failure on Shortest Path in Shortest Path Tree

2011 ◽  
Vol 11 (16) ◽  
pp. 2916-2923
Author(s):  
Muhammad Aasim Qureshi ◽  
Mohd Fadzil Hassan ◽  
Sohail Safdar ◽  
Rehan Akbar
Keyword(s):  
Shortest Path ◽  
Link Failure ◽  
Shortest Path Tree ◽  
Single Link

scholarly journals A Single-Link Failure Recovery Approach Based on Resource Sharing and Performance Prediction in SDN

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 174750-174763
Author(s):  
Ying Wang ◽  
Sixiang Feng ◽  
Hantao Guo ◽  
Xuesong Qiu ◽  
Hengbin An
Keyword(s):  
Performance Prediction ◽  
Resource Sharing ◽  
Failure Recovery ◽  
Link Failure ◽  
Single Link ◽  
And Performance ◽  
Recovery Approach

Software-Defined Networking Switches for Fast Single-Link Failure Recovery

2018 ◽  
Vol 18 (04) ◽  
pp. 1850014
Author(s):  
DAWEI LI ◽  
JIE WU ◽  
DAJIN WANG ◽  
JIAYIN WANG
Keyword(s):  
Network Topology ◽  
Routing Protocols ◽  
Shortest Paths ◽  
Software Defined Networking ◽  
Failure Recovery ◽  
Link Failure ◽  
Fast Recovery ◽  
Link Failures ◽  
Single Link

In this paper, we consider IP fast recovery from single-link failures in a given network topology. The basic idea is to replace some existing routers with a designated switch. When a link fails, the affected router will send all the affected traffic to the designated switch (through pre-configured IP tunnels), which will deliver the affected traffic to its destination without using the failed link. The goal of the approach is to achieve faster failure recovery than traditional routing protocols that employ reactive computing upon link failures. Software-Defined Networking (SDN) switches can serve as the designated switches because they can flexibly redirect affected traffic to other routes, instead of only to the shortest paths in the network. However, SDN switches are very expensive. Our objective is to minimize the number of SDN switches needed and to guarantee that the network can still recover from any single-link failure. For networks with uniform link costs, we show that using normal non-SDN switches with IP tunneling capability as designated switches can guarantee recovery from any single-link failure. For networks with general link costs, we find that not all single-link failures can be recovered by using non-SDN switches as designated switches; by using SDN switches only when necessary, we can reduce the total number of SDN switches needed compared to an existing work. We conduct extensive simulations to verify our proposed approaches.

Link Failure Recovery Using Shortest Path Fast Rerouting Technique in SDN

2017 ◽  
Vol 97 (2) ◽  
pp. 2475-2495 ◽  
Author(s):  
V. Muthumanikandan ◽  
C. Valliyammai
Keyword(s):  
Shortest Path ◽  
Failure Recovery ◽  
Link Failure

ACO based single link failure recovery in all optical networks

Optik ◽  
2016 ◽  
Vol 127 (20) ◽  
pp. 8469-8474 ◽  
Author(s):  
Neeraj Mohan ◽  
Amit Wason ◽  
Parvinder S. Sandhu
Keyword(s):  
Optical Networks ◽  
Failure Recovery ◽  
Link Failure ◽  
All Optical ◽  
Single Link

scholarly journals Algorithms for Single Link Failure Recovery and Related Problems

2004 ◽  
Vol 8 (3) ◽  
pp. 275-294 ◽  
Author(s):  
Amit M. Bhosle ◽  
Teofilo F. Gonzalez
Keyword(s):  
Failure Recovery ◽  
Link Failure ◽  
Single Link
Sign in / Sign up

Export Citation Format

Share Document