A source routing based link protection method for link failure in SDN

2016 ◽  
Author(s):  
Huang Liaoruo ◽  
Shen Qingguo ◽  
Shao Wenjuan
Keyword(s):  
Link Failure ◽  
Source Routing ◽  
Protection Method ◽  
Link Protection

scholarly journals Failure Recovery In SDN: A Segment Routing Based Link Protection Approach

2021 ◽  
Author(s):  
Mirja Shahriar Enan
Keyword(s):  
Computer Network ◽  
Complex Structure ◽  
Failure Recovery ◽  
Total Recovery ◽  
Protection Mechanism ◽  
Fine Grained ◽  
Memory Efficiency ◽  
Protection Method ◽  
Local Recovery ◽  
Link Protection

The present computer network has been evolved into a complex structure with a growing challenge to manage and scale modern day’s requirements. A new approach to tackle these difficulties is SDN, which empowers network with programmability and is designed to perform fine grained traffic forwarding decisions. However, similar to the need of traditional networks, fault tolerance is necessary to achieve high availability. In this thesis, we propose a link protection method based on the Segment Routing (SR) for rapid failure recovery in OpenFlow based SDN. Our proposed scheme performs local recovery at the switch level without the controller intervention, thus significantly reducing the total recovery time. Additionally, it reduces initial load on the controller while proactively computing the backup paths by minimizing the algorithm complexity. Moreover, memory efficiency is achieved by using a per-link protection with aggregated flow rules instead of traditional per-flow based protection mechanism. In Segment Routing, we may encounter the limitation on the size of the label stack, known as Segment List Depth (SLD). Therefore, we also propose an efficient label encoding algorithm to mitigate the SLD impact.

Preconfigured Ball (p-Ball) Protection Method With Minimum Backup Links for Dual-Link Failure in Optical Mesh Networks

2015 ◽  
Vol 19 (3) ◽  
pp. 363-366 ◽  
Author(s):  
Chen Ma ◽  
Jie Zhang ◽  
Yongli Zhao ◽  
Jian Yuan ◽  
Yachao Shi ◽  
...  
Keyword(s):  
Mesh Networks ◽  
Link Failure ◽  
Protection Method ◽  
Optical Mesh Networks

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

2018 ◽  
Vol 27 (06) ◽  
pp. 1850087 ◽  
Author(s):  
Jue Chen ◽  
Jinbang Chen ◽  
Junchen Ling ◽  
Junlong Zhou ◽  
Wei Zhang
Keyword(s):  
High Efficiency ◽  
Failure Recovery ◽  
Link Failure ◽  
Protection Mechanism ◽  
Link Failures ◽  
Wide Applicability ◽  
Backup Path ◽  
Protection Method ◽  
Network Scale ◽  
Backup Paths

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

scholarly journals Survivable Virtual Network Link Protection Method Based on Network Coding and Protection Circuit

IEEE Access ◽  
2018 ◽  
Vol 6 ◽  
pp. 67477-67493 ◽  
Author(s):  
Yuze Su ◽  
Xiangru Meng ◽  
Qiaoyan Kang ◽  
Xiaoyang Han
Keyword(s):  
Network Coding ◽  
Virtual Network ◽  
Protection Method ◽  
Network Link ◽  
Protection Circuit ◽  
Link Protection

scholarly journals Failure Recovery In SDN: A Segment Routing Based Link Protection Approach

2021 ◽  
Author(s):  
Mirja Shahriar Enan
Keyword(s):  
Computer Network ◽  
Complex Structure ◽  
Failure Recovery ◽  
Total Recovery ◽  
Protection Mechanism ◽  
Fine Grained ◽  
Memory Efficiency ◽  
Protection Method ◽  
Local Recovery ◽  
Link Protection

The present computer network has been evolved into a complex structure with a growing challenge to manage and scale modern day’s requirements. A new approach to tackle these difficulties is SDN, which empowers network with programmability and is designed to perform fine grained traffic forwarding decisions. However, similar to the need of traditional networks, fault tolerance is necessary to achieve high availability. In this thesis, we propose a link protection method based on the Segment Routing (SR) for rapid failure recovery in OpenFlow based SDN. Our proposed scheme performs local recovery at the switch level without the controller intervention, thus significantly reducing the total recovery time. Additionally, it reduces initial load on the controller while proactively computing the backup paths by minimizing the algorithm complexity. Moreover, memory efficiency is achieved by using a per-link protection with aggregated flow rules instead of traditional per-flow based protection mechanism. In Segment Routing, we may encounter the limitation on the size of the label stack, known as Segment List Depth (SLD). Therefore, we also propose an efficient label encoding algorithm to mitigate the SLD impact.

Link failure resilience in the dynamic source routing protocol

2009 ◽  
Vol 9 (5) ◽  
pp. 591-605
Author(s):  
Mohamed Aissani ◽  
Abdelhamid Mellouk ◽  
Walid Demigha ◽  
Mustapha Réda Senouci
Keyword(s):  
Routing Protocol ◽  
Link Failure ◽  
Source Routing ◽  
Failure Resilience ◽  
Dynamic Source Routing ◽  
Dynamic Source

On Number of Planes of Rearrangeably Nonblocking Optical Banyan Networks with Link Failures

2008 ◽  
Vol 1 (1) ◽  
pp. 43-54
Author(s):  
Basra Sultana ◽  
Mamun-ur-Rashid Khandker
Keyword(s):  
Optical Switching ◽  
Blocking Probability ◽  
Link Failure ◽  
Link Failures ◽  
Small Depth ◽  
Internal Link ◽  
Banyan Network ◽  
Minimum Number ◽  
Switch Design ◽  
Banyan Networks

Vertically stacked optical banyan (VSOB) networks are attractive for serving as optical switching systems due to the desirable properties (such as the small depth and self-routing capability) of banyan network structures. Although banyan-type networks result in severe blocking and crosstalk, both these problems can be minimized by using sufficient number of banyan planes in the VSOB network structure. The number of banyan planes is minimum for rearrangeably nonblocking and maximum for strictly nonblocking structure. Both results are available for VSOB networks when there exist no internal link-failures. Since the issue of link-failure is unavoidable, we intend to find the minimum number of planes required to make a VSOB network nonblocking when some links are broken or failed in the structure. This paper presents the approximate number of planes required to make a VSOB networks rearrangeably nonblocking allowing link-failures. We also show an interesting behavior of the  blocking  probability of a faulty VSOB networks that the blocking probability may not  always  increase monotonously with  the  increase  of  link-failures; blocking probability  decreases  for  certain range of  link-failures, and then increases again. We believe that such fluctuating behavior of blocking probability with the increase of link failure probability deserves special attention in switch design.  Keywords: Banyan networks; Blocking probability; Switching networks; Vertical stacking; Link-failures. © 2009 JSR Publications. ISSN: 2070-0237(Print); 2070-0245 (Online). All rights reserved. DOI: 10.3329/jsr.v1i1.1070

Sign in / Sign up

Export Citation Format

Share Document