Corrigendum to: Congestion Free Transient Plane(CFTP) using bandwidth sharing during link failures in SDN

2020 ◽  
Author(s):  
Muthumanikandan Vanamoorthy ◽  
Valliyammai Chinnaiah
2019 ◽  
Vol 63 (6) ◽  
pp. 832-843
Author(s):  
Muthumanikandan Vanamoorthy ◽  
Valliyammai Chinnaiah

Abstract Software-defined networking (SDN) is an emerging trend where the control plane and the data plane are separated from each other, culminating in effective bandwidth utilization. This separation also allows multi-vendor interoperability. Link failure is a major problem in networking and must be detected as soon as possible because when a link fails the path becomes congested and packet loss occurs, delaying the delivery of packets to the destination. Backup paths must be configured immediately when a failure is detected in the network to speed up packet delivery, avoid congestion and packet loss and provide faster convergence. Various SDN segment protection algorithms that efficiently reduce CPU cycles and flow table entries exist, but each has drawbacks. An independent transient plane technique can be used to reduce packet loss but is not as efficient when multiple flows try to share the same link. The proposed work focuses on reducing congestion, providing faster convergence with minimal packet loss and effectively utilizing link bandwidth using bandwidth-sharing techniques. An analysis and related studies show that this method performs better and offers a more reliable network without loss, while simultaneously ensuring the swift delivery of data packets toward the destination without congestion, compared to the other existing schemes.


2008 ◽  
Vol 1 (1) ◽  
pp. 43-54
Author(s):  
Basra Sultana ◽  
Mamun-ur-Rashid Khandker

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


Author(s):  
Jose M. Gutierrez ◽  
Tahir Riaz ◽  
Jens M. Pedersen ◽  
Ole B. Madsen ◽  
Konstantinos Georgakilas ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document