Analysis of Blocking Probability for First-Fit Wavelength Assignment in Transmission-Impaired Optical Networks

2011 ◽  
Vol 3 (5) ◽  
pp. 411 ◽  
Author(s):  
Jun He ◽  
Maïté Brandt-Pearce ◽  
Suresh Subramaniam
Keyword(s):  
Optical Networks ◽  
Blocking Probability ◽  
Wavelength Assignment

scholarly journals Routing Strategies in Survivable Optical Networks

2013 ◽  
Vol 9 (2) ◽  
pp. 1055-1062
Author(s):  
Ifrah Amin ◽  
Gulzar Ahmad dar ◽  
Hrdeep singh Saini
Keyword(s):  
Optical Networks ◽  
Blocking Probability ◽  
Optical Network ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Routing Problem ◽  
Routing Strategy ◽  
Survivable Optical Networks ◽  
Conventional Algorithm ◽  
Better Than

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. 

Dynamic routing and wavelength assignment for efficient traffic grooming

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Neeraj Mohan ◽  
Priyanka Kaushal
Keyword(s):  
Optical Networks ◽  
Resource Utilization ◽  
Wavelength Division Multiplexing ◽  
Computer Network ◽  
Blocking Probability ◽  
Traffic Grooming ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Dynamic Traffic ◽  
Network Efficiency

AbstractThe routing and wavelength assignment (RWA) schemes play an important role in all computer networks. The performance of a computer network and resource utilization largely depend on the RWA. The demand for higher bandwidth is increasing with each passing day, so more efficient RWA schemes need to be devolved to cater the increasing requirements. RWA becomes more challenging for dynamic traffic as the nature and flow of data are not known in advance. In this paper, a dynamic RWA scheme has been proposed for establishing a path in optical networks. The proposed scheme is based upon dynamic conversion sensing algorithm. It can be applied on a number of different network topologies. The proposed scheme is dynamic in nature, which is significantly useful for dynamic traffic grooming. The proposed scheme has been applied on 14 nodes National Science Foundation Network (NFSNet). Simulation results have shown that the blocking probability of this scheme is very low as compared to the existing schemes. So, the proposed dynamic RWA scheme enhances the network efficiency. It is useful for congestion hit networks. The reduced blocking probability in wavelength division multiplexing optical networks leads to better resource utilization and enhanced performance.

Yen-BSR: A New Approach for the Choice of Routes in WDM Networks

2014 ◽  
Vol 35 (4) ◽  
Author(s):  
A. F. Santos ◽  
R. C. Almeida ◽  
K. D. R. Assis
Keyword(s):  
Optical Networks ◽  
Blocking Probability ◽  
Shortest Paths ◽  
Wavelength Assignment ◽  
Wdm Networks ◽  
Superior Performance ◽  
Wavelength Routing ◽  
Algorithm Performance ◽  
New Approach ◽  
Shortest Path Routing

AbstractIn this paper we propose to use an iterative algorithm for optimizing the fixed-alternate shortest path routing in the dynamic routing and wavelength assignment (RWA) problem in wavelength routing optical networks. The algorithm performance is compared, in terms of blocking probability, with the Dijkstra and Yen traditional algorithms, as well as with the recently proposed best among the shortest routes (BSR) algorithm. The results suggest that it is feasible to choose an appropriate set of routes for each pair of nodes (source, destination), among the shortest paths and efficiently balance the network load. For all studied scenarios, the proposed heuristic achieved superior performance.

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.

scholarly journals Wavelength Converter Based Optimized RWA for All Optical Networks

2019 ◽  
Vol 8 (2) ◽  
pp. 111-115
Author(s):  
Shilpa S. Patil ◽  
Bharat S. Chaudhari
Keyword(s):  
Optical Networks ◽  
Network Performance ◽  
Blocking Probability ◽  
Wavelength Assignment ◽  
Wdm Networks ◽  
Optimal Placement ◽  
Wavelength Converters ◽  
Wavelength Converter ◽  
Call Blocking ◽  
Call Blocking Probability

Wavelength converters are used in WDM networks to avoid call blocking and minimizing the blocking probability. Optimal placement of wavelength converters restricts the call blocking probability, the complexity and improves the overall network performance of the network. In this paper, we propose a new weight dependent routing and wavelength assignment algorithm for the optimal placement of the wavelength converters. The wavelength converter placement was considered separately at all the nodes and the partial nodes. Our algorithm outperforms the previously reported studies and requires a lesser number of wavelength converters to achieve the required performance. It reduces the blocking probabilities up to 5.4% and shows that the first four nodes primarily control the blocking performance of the network. The study also reveals that instead of merely increasing the number of converters, their placement at the right location plays a crucial role in improving the performance. Initially, although an increase in the number of the wavelengths also improves the network performance, the further increase does not contribute much to the reduction of the blocking probability.

Physical layer impairment-aware ant colony optimization approach in WDM network

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Vikram Kumar ◽  
Santos Kumar Das
Keyword(s):  
Ant Colony Optimization ◽  
Optical Networks ◽  
Wavelength Division Multiplexing ◽  
Blocking Probability ◽  
Physical Layer ◽  
Wavelength Assignment ◽  
Wdm Networks ◽  
Ant Colony ◽  
Optimization Approach ◽  
Estimation Model

AbstractPhysical layer impairments (PLIs) is a matter of great concern in optical networks to achieve the optimum performance. In order to mitigate the PLI, a better routing and wavelength assignment (RWA) technique is required in optical wavelength division multiplexing (WDM) networks. In this paper, a dynamic ant colony routing algorithm with the consideration of various PLIs has been presented. This work also presents a Q-factor estimation model that includes impairments such as amplified spontaneous emission (ASE) noise, four-wave mixing (FWM), and cross phase modulation (XPM). The simulation results also prove that the proposed ant colony optimization (ACO) based algorithm significantly reduces the blocking probability as compared to dynamic load based shortest path algorithm (LB-SPA).

scholarly journals A Memetic based Approach for Routing and Wavelength Assignment in Optical Transmission Systems

2019 ◽  
pp. 11-18
Keyword(s):  
Genetic Algorithm ◽  
Optical Networks ◽  
Performance Metrics ◽  
Optimization Problems ◽  
Fitness Function ◽  
Blocking Probability ◽  
Setup Time ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Hop Count

In optical networks, Routing and Wavelength Assignment (RWA) problem is one of the major optimization problems. This problem can be solved by different algorithms such as Genetic Algorithm (GA), Artificial Bee Colony (ABC), Ant Colony Optimization (ACO), etc. Shuffled Frog Leaping Algorithm (SFLA) is implemented in the proposed work, to solve the RWA problem in long-haul optical networks. The goal is to use minimum number of wavelengths and to reduce the number of connection request rejections. Cost, number of wavelengths, hop count and blocking probability are the performance metrics considered in the analysis. Various wavelength assignment methods such as first fit, random, round robin, wavelength ordering and Four Wave Mixing (FWM) priority based wavelength assignment are used in the analysis using SFLA. Number of wavelengths, hop count, cost and setup time are included in the fitness function. The SFLA algorithm proposed, has been analyzed for different network loads and compared with the performance of genetic algorithm.

scholarly journals An Efficient Scheme on Adaptable Priority-Based Routing and Wavelength Assignment Algorithm for Enhanced Quality of Service

2019 ◽  
Vol 9 (1) ◽  
pp. 4257-4260
Keyword(s):  
Quality Of Service ◽  
Optical Networks ◽  
Blocking Probability ◽  
Optical Network ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Hop Count ◽  
End To End Delay ◽  
End To End

Current research interests have diverted towards the efficient priority-based routing and wavelength assignment strategy in order to enhance the quality of service in the distributed optical networks. The traditional RWA techniques such as Adaptive Routing (AR), Non priority based RWA schemes etc. are lacking of capability to reduce both the blocking probability and average end to end delay simultaneously during the transmission of networks. In this paper, an Adaptable Priority-based RWA (APRWA) schemes for optical network has been demonstrated and evaluated by utilizing the performance enhancing metric such as reduction in hop count while simultaneously handling distinguishable traffic volume. The simulation result shows considerable reduction both in the blocking probability (approx. 25%) as well as in average end to end delay near around (15 msec.) in comparison to conventional RWA techniques.

Multi-hop traffic grooming routing and wavelength assignment using split light trail in WDM all optical mesh networks

2021 ◽  
pp. 1-14
Author(s):  
Sampa Rani Bhadra ◽  
Ashok Kumar Pradhan ◽  
Utpal Biswas
Keyword(s):  
Mesh Networks ◽  
Blocking Probability ◽  
Wavelength Assignment ◽  
End User ◽  
Network Resources ◽  
Wdm Network ◽  
Optical Wdm ◽  
All Optical ◽  
User Access ◽  
Optical Mesh Networks

For the last few decades, fiber optic cables not only replaced copper cables but also made drastic evolution in the technology to overcome the optoelectronic bandwidth mismatch. Light trail concept is such an attempt to minimize the optoelectronic bandwidth gap between actual WDM bandwidth and end user access bandwidth. A light trail is an optical bus that connects two nodes of an all optical WDM network. In this paper, we studied the concept of split light trail and proposed an algorithm namely Static Multi-Hop Split Light Trail Assignment (SMSLTA), which aims to minimize blocking probability, the number of static split light trails assigned and also the number of network resources used, at the same time maximizing the network throughput. Our proposed algorithm works competently with the existing algorithms and generates better performance in polynomial time complexity.

scholarly journals The Traffic Grooming Problem in Optical Networks with Respect to ADMs and OADMs: Complexity and Approximation

Algorithms ◽  
2021 ◽  
Vol 14 (5) ◽  
pp. 151
Author(s):  
Michele Flammini ◽  
Gianpiero Monaco ◽  
Luca Moscardelli ◽  
Mordechai Shalom ◽  
Shmuel Zaks
Keyword(s):  
Cost Function ◽  
Optical Networks ◽  
Cost Minimization ◽  
Convex Combination ◽  
Optical Network ◽  
Switching Cost ◽  
Wavelength Assignment ◽  
Intermediate Node ◽  
Polynomial Time Approximation Algorithm ◽  
Path Topology

All-optical networks transmit messages along lightpaths in which the signal is transmitted using the same wavelength in all the relevant links. We consider the problem of switching cost minimization in these networks. Specifically, the input to the problem under consideration is an optical network modeled by a graph G, a set of lightpaths modeled by paths on G, and an integer g termed the grooming factor. One has to assign a wavelength (modeled by a color) to every lightpath, so that every edge of the graph is used by at most g paths of the same color. A lightpath operating at some wavelength λ uses one Add/Drop multiplexer (ADM) at both endpoints and one Optical Add/Drop multiplexer (OADM) at every intermediate node, all operating at a wavelength of λ. Two lightpaths, both operating at the same wavelength λ, share the ADMs and OADMs in their common nodes. Therefore, the total switching cost due to the usage of ADMs and OADMs depends on the wavelength assignment. We consider networks of ring and path topology and a cost function that is a convex combination α·|OADMs|+(1−α)|ADMs| of the number of ADMs and the number of OADMs deployed in the network. We showed that the problem of minimizing this cost function is NP-complete for every convex combination, even in a path topology network with g=2. On the positive side, we present a polynomial-time approximation algorithm for the problem.

Sign in / Sign up

Export Citation Format

Share Document