A Novel Survivability Technique: DHMBC for WDM Optical Networks

2018 ◽  
Vol 0 (0) ◽  
Author(s):  
Himanshi Saini ◽  
Amit Kumar Garg
Keyword(s):  
Optical Networks ◽  
High Speed ◽  
Network Performance ◽  
Blocking Probability ◽  
Destination Node ◽  
Wdm Optical Networks ◽  
Network Resource ◽  
High Speed Networks ◽  
Network Protection ◽  
Huge Data

AbstractFailures and malicious attacks in high-speed optical networks lead to huge data as well as revenue loss. In this paper, a survivability technique called Dynamic and Hybrid with Multiple Backup selection Criteria technique for high-speed networks has been proposed with the objective to minimize network resource utilization, blocking probability, End-to-End delay and maximize throughput. The proposed model decides the type of backup provisioning technique based on the location of failure in the network. Protection has been provisioned to selective links near to destination node and other links are restored. The simulation results indicate that proposed survivability technique is efficient as compared to conventional techniques in terms of various network performance measuring parameters. This technique inherits merits of protection as well as restoration. It can be practically implemented to provide resilience in future high-speed networks.

A Dynamic Resilience Approach for WDM Optical Networks

2017 ◽  
Vol 38 (4) ◽  
Author(s):  
Amit Kumar Garg
Keyword(s):  
Optical Networks ◽  
Blocking Probability ◽  
Quality Of Services ◽  
Optical Fibres ◽  
Wdm Optical Networks ◽  
Network Resource ◽  
Communication Services ◽  
Single Link ◽  
Simulation Results

AbstractOptical fibres have been developed as a transmission medium to carry traffic in order to provide various services in telecommunications platform. Failure of this fibre caused loss of data which can interrupt communication services. This paper has been focused only on survivable schemes in order to guarantee both protection and restoration in WDM optical networks. In this paper, a dynamic resilience approach has been proposed whose objective is to route the flows in a way which minimizes the total amount of bandwidth used for working and protection paths. In the proposed approach, path-based protection is utilized because it yields lower overhead and is also suitable for global optimization where, in case of a single link failure, all the flows utilizing the failed link are re-routed to a pre-computed set of paths. The simulation results demonstrate that proposed approach is much more efficient as it provides better quality of services (QoS) in terms of network resource utilization, blocking probability etc. as compared to conventional protection and restoration schemes. The proposed approach seems to offer an attractive combination of features, with both ring like speed and mesh-like efficiency.

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.

scholarly journals Statistical Assessment of Open Optical Networks

Photonics ◽  
2019 ◽  
Vol 6 (2) ◽  
pp. 64 ◽  
Author(s):  
Emanuele Virgillito ◽  
Alessio Ferrari ◽  
Andrea D’Amico ◽  
Vittorio Curri
Keyword(s):  
Optical Networks ◽  
Network Performance ◽  
Blocking Probability ◽  
Optical Network ◽  
Network Capacity ◽  
Physical Layer ◽  
Point Of View ◽  
Assessment Process ◽  
Physical Parameters ◽  
High Level

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.

Analysis of optical networks in presence of nodes noise and crosstalk

2022 ◽  
Vol 0 (0) ◽  
Author(s):  
Rahul Deo Shukla ◽  
Ajay Pratap ◽  
Raghuraj Singh Suryavanshi
Keyword(s):  
Optical Networks ◽  
Shortest Path ◽  
High Speed ◽  
Optical Switching ◽  
Optical Packet Switching ◽  
Shortest Path Algorithm ◽  
High Speed Networks ◽  
Path Distance ◽  
Minimum Delay ◽  
Shortest Path Distance

Abstract Optical packet switching has gained lot of momentum in last decade due to the advantages of optical fiber over copper cables. Optical switching is beneficial in optical networks which form connections of links and switching nodes. In these high speed networks minimum delay and high throughput are two important parameters which are considered. To minimize network delay shortest path algorithm is used for route selections. In previous studies while choosing shortest path distance among various nodes is considered. In this work we have shown that it is necessary to consider both distance and number of hops while choosing path from source to destination to minimize power per bit used for the transmission.

scholarly journals New Heuristic Algorithm for Dynamic Traffic in WDM Optical Networks

2015 ◽  
Vol 35 (3) ◽  
pp. 100-106 ◽  
Author(s):  
Arturo Benito Rodríguez Garcia ◽  
Leonardo Ramirez Lopez ◽  
Juan Carlos Travieso Torres
Keyword(s):  
Genetic Algorithms ◽  
Optical Networks ◽  
Heuristic Algorithm ◽  
Heuristic Algorithms ◽  
Blocking Probability ◽  
Wdm Optical Networks ◽  
Dynamic Traffic ◽  
Relative Growth ◽  
Traffic Conditions ◽  
Network Utilization

<p class="Abstractandkeywordscontent">The results and comparison of the simulation of a new heuristic algorithm called Snake One are presented. The comparison is made with three heuristic algorithms, Genetic Algorithms, Simulated Annealing, and Tabu Search, using blocking probability and network utilization as standard indicators. The simulation was made on the WDM NSFNET under dynamic traffic conditions. The results show a substantial decrease of blocking, but this causes a relative growth of network utilization. There are also load intervals at which its performance improves, decreasing the number of blocked requests.</p>

Study on Optical Performance Monitoring for Fiber-Optical Link Utilizing Chaos Theory

2012 ◽  
Vol 571 ◽  
pp. 390-394 ◽  
Author(s):  
Qing Qing Fan ◽  
He Li ◽  
Hong Xi Yin
Keyword(s):  
Optical Networks ◽  
Chaos Theory ◽  
High Speed ◽  
Performance Monitoring ◽  
Recurrence Plot ◽  
Maximum Lyapunov Exponent ◽  
Wdm Optical Networks ◽  
Optical Performance Monitoring ◽  
Optical Link ◽  
Link Performance

Optical-link performance monitoring (OLPM) plays a crucial role in ensuring the link performance, the channel assignment and the network reconfiguration in the high-speed and WDM optical networks. An OLPM scheme based on the chaos theory and the pattern recognition is proposed in this paper. The identification results of nonlinear regimes of 4/8/16-channel WDM links with 10 Gb/s are demonstrated through utilizing the maximum Lyapunov exponent, the recurrence plot and the two-layer perceptron.

Design and Analysis of Stimulated Raman Scattering-Aware Algorithm in RWA

2017 ◽  
Vol 38 (2) ◽  
Author(s):  
Wai S. Sim ◽  
Saw C. Tan ◽  
Zulfadzli Yusoff
Keyword(s):  
Raman Scattering ◽  
Optical Networks ◽  
National Science Foundation ◽  
Network Performance ◽  
Stimulated Raman Scattering ◽  
Blocking Probability ◽  
Wavelength Assignment ◽  
Ultimate Objective ◽  
Necessary And Sufficient ◽  
Stimulated Raman

AbstractA stimulated Raman scattering (SRS)-aware routing and wavelength assignment (RWA) scheme, called assign minimum interference and shortest algorithm, is proposed to minimize the effect of SRS in network. The design parameter, the number of interference of routes in the proposed algorithm is investigated to analyze its capabilities of influence the network performance. The various setting of the parameter is tested in 15-nodes Mesh and 14-nodes National Science Foundation networks for analysis in order to provide useful guidelines for designing effective SRS-aware RWA scheme. The ultimate objective is to define the necessary and sufficient rules that must be followed in the proposed algorithm by identifying the necessary RWA parameters in order to minimize the effect of SRS in optical networks. The result shows that the smaller the number of interference of routes, the lower the blocking probability in the mentioned topologies.

Sign in / Sign up

Export Citation Format

Share Document