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

scholarly journals Upper Bound on Blocking Probability for Vertically Stacked Optical Banyan Networks with Link Failures and Given Crosstalk Constraint

2009 ◽  
Vol 1 (3) ◽  
pp. 484-494
Author(s):  
M. R. Khandker ◽  
B. Sultana
Keyword(s):  
Upper Bound ◽  
Optical Switching ◽  
Network Performance ◽  
Blocking Probability ◽  
Hardware Cost ◽  
Link Failures ◽  
Banyan Network ◽  
Multiple Copies ◽  
Simulation Results ◽  
Banyan Networks

Vertical stacking of multiple copies of an optical banyan network is a novel scheme for building nonblocking optical switching networks. The resulting network, namely vertically stacked optical banyan (VSOB) network, preserves all the properties of the banyan network, but increases the hardware cost significantly under first order crosstalk-free constraint. However, stringent crosstalk constraint may not always be necessary. Considering the fact that some designer may want to compromise the blocking probability and crosstalk constraint to a certain degree with the hardware cost, blocking behaviour of such VSOB networks have been analyzed to studying network performance and finding a graceful compromise between hardware costs and blocking probability under or without crosstalk constraint. In this paper, we present the simulation results for upper bound on blocking probability of VSOB networks with link failures and given degree of crosstalk constraint. We show how crosstalk adds a new dimension to the performance analysis on a VSOB networks. The simulation results presented in this paper can guide network designer in finding the trade-off among the blocking probability, the degree of crosstalk and the hardware cost in terms of vertical copies of banyan network in the presence of link failures.Keywords: Banyan networks; Blocking probability; Vertical stacking; Link-failures; Crosstalk.© 2009 JSR Publications. ISSN: 2070-0237 (Print); 2070-0245 (Online). All rights reserved.DOI: 10.3329/jsr.v1i3.1191       J. Sci. Res. 1 (3), 484-494 (2009)

Blocking Probability Analysis for Optical Banyan Networks With Link Failure

2018 ◽  
Vol 66 (9) ◽  
pp. 4074-4086
Author(s):  
Lisheng Ma ◽  
Xiaohong Jiang ◽  
Achille Pattavina
Keyword(s):  
Blocking Probability ◽  
Probability Analysis ◽  
Link Failure ◽  
Banyan Networks

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.

Design of Structural Controllability for Complex Network Architecture

2016 ◽  
pp. 98-124
Author(s):  
Amitava Mukherjee ◽  
Ayan Chatterjee ◽  
Debayan Das ◽  
Mrinal K. Naskar
Keyword(s):  
Complex Networks ◽  
Real World ◽  
Network Architecture ◽  
Structural Control ◽  
Link Failures ◽  
Novel Approach ◽  
Minimum Number ◽  
Structural Controllability ◽  
Reduced Complexity ◽  
Simulation Results

Networks are all-pervasive in nature. The complete structural controllability of a network and its robustness against unwanted link failures and perturbations are issues of immense concern. In this chapter, we propose a heuristic to determine the minimum number of driver nodes for complete structural control, with a reduced complexity. We also introduce a novel approach to address the vulnerability of the real-world complex networks, and enhance the robustness of the network, prior to an attack or failure. The simulation results reveal that dense and homogenous networks are easier to control with lesser driver nodes, and are more robust, compared to sparse and inhomogeneous networks.

A parallel cross-connection recovery scheme for dual link failure in elastic optical networks

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Dinesh Kumar ◽  
Rajiv Kumar ◽  
Neeru Sharma
Keyword(s):  
Optical Networks ◽  
High Speed ◽  
Blocking Probability ◽  
Link Failure ◽  
Recovery Strategy ◽  
Intermediate Node ◽  
Path Protection ◽  
Connection Recovery ◽  
Shared Path Protection ◽  
Cross Connection

Abstract In this paper, we proposed a fast recovery strategy for a dual link failure (DLF) in elastic optical network (EON). The EON is a promising solution to meet the next generation higher bandwidth demand. The survivability of high speed network is very crucial. As the network size increases the probability of the DLF and node failure also increases. Here, we proposed a parallel cross connection backup recovery strategy for DLF in the network. The average bandwidth blocking probability (BBP), bandwidth provisioning ratio (BPR), and recovery time (RT) for our proposed Intermediate node cross-connect backup for shared path protection (INCB-SPP) for ARPANET are 0.38, 2.71, 4.68 ms, and for DPP 0.70, 6.02, 8.71 ms and for SPP 0.40, 2.87, and 16.33 ms respectively. The average BBP, BPR, and RT of INCB-SPP for COST239 are 0.01, 1.71, 3.79 ms and for DPP are 0.39, 3.50, 8.20 ms and SPP are 0.04, 1.75, and 12.47 ms respectively. Hence, the proposed strategy shows lower BBP, fast connection recovery, and BPR when compared with the existing shared path protection (SPP) and dedicated path protection (DPP) approaches. Simulation is performed on ARPANET and COST239 topology networks.

Sign in / Sign up

Export Citation Format

Share Document