Dynamic Anycast Routing and Wavelength Assignment in WDM Networks Using Ant Colony Optimization (ACO)

2011 ◽  
Author(s):  
Kavitha Bhaskaran ◽  
Joan Triay ◽  
Vinod M. Vokkarane
Keyword(s):  
Ant Colony Optimization ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Wdm Networks ◽  
Ant Colony ◽  
Anycast Routing

Wavelength and Routing Assignment in All Optical Networks Using Ant Colony Optimization

2013 ◽  
pp. 217-234
Author(s):  
Ana Maria Sarmiento ◽  
Gerardo Castañón ◽  
Fernando Lezama
Keyword(s):  
Ant Colony Optimization ◽  
Optical Networks ◽  
Routing And Wavelength Assignment ◽  
Wavelength Assignment ◽  
Ant Colony ◽  
Mesh Network ◽  
Heuristic Strategies ◽  
All Optical ◽  
Network Topologies ◽  
Np Complete

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.

Sign in / Sign up

Export Citation Format

Share Document