scholarly journals A Proactive Link Based Fast Recovery Strategy for Survival Elastic Optical Networks

In this paper, we proposed a link based fast connection recovery strategy. A backup path either reserved in advance or searched dynamically after the failure occurred in the network. Both these recovery strategy required large backup capacity. We analyse three network parameters such as recovery time (RT), bandwidth blocking probability (BBP), and network capacity utilization ratio (NCU) for randomly generated source to destination request for three topologies that is COST239, ARPANET and NSFNET and compare the results for shared link protection (SLP), dedicated link protection (DLP), and our proposed link protection (PLP) scheme. Our proposed scheme shows the minimum RT compared to other two strategies.

2020 ◽  
Vol 8 (5) ◽  
pp. 4245-4249

In the last few years, internet traffic increases continuously due to the more use of live streaming and social sites. To accommodate such high traffic demand the more bandwidth is required. The elastic optical network (EON) is a promising solution for the capacity expansion that can meet the future bandwidth requirement. The EON can provide a higher bit rate. In this paper we purposed a recovery strategy for failure in EON. Our purposed strategy shows the more acceptance rate for randomly generated source (s)-destination (d) requests. Here we considered two topologies viz. COST239 and NSFNET. Then evaluate their performance for Recovery Time, bandwidth blocking probability (BBP) and network capacity utilization (NCU), in which our purposed scheme provides lesser BBP and lower NCU for both topologies and low recovery time than shared path protection (SPP and dedicated path protection (DPP).


2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Dinesh Kumar ◽  
Rajiv Kumar ◽  
Neeru Sharma

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.


Photonics ◽  
2019 ◽  
Vol 6 (2) ◽  
pp. 64 ◽  
Author(s):  
Emanuele Virgillito ◽  
Alessio Ferrari ◽  
Andrea D’Amico ◽  
Vittorio Curri

In order to cope with the increase of the final user traffic, operators and vendors are pushing towards physical layer aware networking as a way to maximize the network capacity. To this aim, optical networks are becoming more and more open by exposing physical parameters enabling fast and reliable estimation of the lightpath quality of transmission. This comes in handy not only from the point of view of the planning and managing of the optical paths but also on a more general picture of the whole optical network performance. In this work, the Statistical Network Assessment Process (SNAP) is presented. SNAP is an algorithm allowing for estimating different network metrics such as blocking probability or link saturation, by generating traffic requests on a graph abstraction of the physical layer. Being aware of the physical layer parameters and transceiver technologies enables assessing their impact on high level network figures of merit. Together with a detailed description of the algorithm, we present a comprehensive review of several results on the networking impact of multirate transceivers, flex-grid spectral allocation as a means to finely exploit lightpath capacity and of different Space Division Multiplexing (SDM) solutions.


Photonics ◽  
2021 ◽  
Vol 8 (10) ◽  
pp. 456
Author(s):  
Shengyu Zhang ◽  
Kwan Lawrence Yeung ◽  
Along Jin

We consider a space-division multiplexing elastic optical network (SDM-EON) that supports super-channels (SChs). A Sch comprises a set of contiguous frequency slots on multiple cores in a multi-core fiber. The problem of finding a lightpath using SChs involves routing, modulation, spectrum and core assignment (RMSCA). To minimize the request blocking probability (RBP), two critical issues must be addressed. First, routing and modulation assignment (RMA) should not cause hotspots, or overutilized links. Second, spectrum and core assignment (SCA) should aim at minimizing fragmentation, or small frequency slot blocks that can hardly be utilized by future requests. In this paper, a pre-computation method is first proposed for better load balancing in RMA. Then an efficient fragmentation-aware SCA is proposed based on a new fragmentation metric that measures both the spectral and spatial fragmentation. With the enhanced RMA and SCA, a joint load-balanced and fragmentation-aware algorithm called LBFA is designed to solve the RMSCA problem. As compared with the existing algorithms, simulation results show that our LBFA provides significant reduction in RBP.


2013 ◽  
Vol 9 (2) ◽  
pp. 1055-1062
Author(s):  
Ifrah Amin ◽  
Gulzar Ahmad dar ◽  
Hrdeep singh Saini

Routing and wavelength assignment problem is one of the main problem in optical networks. The foremost problem is the routing problem after which the wavelength assignment is to be decided. In this paper we have proposed a routing strategy for optimization of the performance of the optical network in terms of blocking probability. The strategy proposed is better than the conventional algorithm in terms of blocking. 


2013 ◽  
Vol 62 (3) ◽  
pp. 1303-1313 ◽  
Author(s):  
Hiroki Nishiyama ◽  
Yuta Tada ◽  
Nei Kato ◽  
Naoko Yoshimura ◽  
Morio Toyoshima ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document