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

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Neeraj Mohan ◽  
Surbhi Gupta ◽  
Abhay Bhandari
Keyword(s):  
High Speed ◽  
Mesh Networks ◽  
Wavelength Division Multiplex ◽  
Failure Recovery ◽  
Link Failure ◽  
Network Simulator ◽  
Link Failures ◽  
Wavelength Division ◽  
Replication Method ◽  
P Cycle

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

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 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 POL-MUX System for Noncoherent Optical Networks

2021 ◽  
Vol 11 (12) ◽  
pp. 5582
Author(s):  
Radim Sifta ◽  
Michal Latal ◽  
Petr Munster ◽  
Tomas Horvath
Keyword(s):  
Signal Processing ◽  
Optical Networks ◽  
High Speed ◽  
Wavelength Division Multiplex ◽  
Digital Signal ◽  
Coherent Detection ◽  
Dynamic Polarization ◽  
Transport Networks ◽  
Optical Transport Networks ◽  
Wavelength Division

This paper is focused on applying a polarization multiplex to passive optical networks to double their transmission bandwidth without significant changes in the distribution network. Although polarization multiplexes are already employed for high-speed optical transport networks with digital signal processing and coherent detection, we propose a system that could be used in existing older optical networks using a dynamic polarization controller in combination with a wavelength division multiplex.

Maximizing double-link failure recovery of over-dimensioned optical mesh networks

2020 ◽  
Vol 36 ◽  
pp. 100541
Author(s):  
Pruk Sasithong ◽  
Le Quang Quynh ◽  
Poompat Saengudomlert ◽  
Pisit Vanichchanunt ◽  
Nguyen Hoang Hai ◽  
...  
Keyword(s):  
Mesh Networks ◽  
Failure Recovery ◽  
Link Failure ◽  
Optical Mesh Networks

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