Distributed Grooming, Routing, and Wavelength Assignment for Dynamic Optical Networks Using Ant Colony Optimization

2014 ◽  
Vol 6 (6) ◽  
pp. 578 ◽  
Author(s):  
X. Wang ◽  
M. Brandt-Pearce ◽  
S. Subramaniam
Author(s):  
Ana Maria Sarmiento ◽  
Gerardo Castañón ◽  
Fernando Lezama

Routing and Wavelength Assignment (RWA) in an arbitrary mesh network is an NP-complete problem. So far, this problem has been solved by linear programming for network topologies with a few nodes, and sub-optimally solved for larger networks by heuristic strategies and the application of optimization algorithms such as Genetic Algorithms (GA), Particle Swarm Optimization (PSO), Differential Evolution (DE), etc. In this chapter, the authors present the use of Ant Colony Optimization (ACO) to find near optimal solutions to the routing and wavelength assignment problem in real sized networks with up to 40 nodes and 65 connecting links. They compare their results to the lower bounds obtained by the Nagatsu’s method, finding them to be equal or very close (one wavelength over) to them.


2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Vikram Kumar ◽  
Santos Kumar Das

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).


Sign in / Sign up

Export Citation Format

Share Document