A new algorithm for the distributed RWA problem in WDM networks using ant colony optimization

  • Authors:

  • Víctor M. Aragón;Ignacio De Miguel;Ramón J. Durán;Noemí Merayo;Juan Carlos Aguado;Patricia Fernández;Rubén M. Lorenzo;Evaristo J. Abril

  • Affiliations:

  • Dpt. Signal Theory, Communications and Telematic Engineering, University of Valladolid, Valladolid, Spain;Dpt. Signal Theory, Communications and Telematic Engineering, University of Valladolid, Valladolid, Spain;Dpt. Signal Theory, Communications and Telematic Engineering, University of Valladolid, Valladolid, Spain;Dpt. Signal Theory, Communications and Telematic Engineering, University of Valladolid, Valladolid, Spain;Dpt. Signal Theory, Communications and Telematic Engineering, University of Valladolid, Valladolid, Spain;Dpt. Signal Theory, Communications and Telematic Engineering, University of Valladolid, Valladolid, Spain;Dpt. Signal Theory, Communications and Telematic Engineering, University of Valladolid, Valladolid, Spain;Dpt. Signal Theory, Communications and Telematic Engineering, University of Valladolid, Valladolid, Spain

  • Venue:
  • ONDM'07 Proceedings of the 11th international IFIP TC6 conference on Optical network design and modeling
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present a new algorithm based on ant colony optimization to solve the dynamic routing and wavelength assignment problem in a distributed manner. The algorithm uses the ant colony optimization metaheuristic to obtain updated information about the network state, which is then used to find the routes and wavelengths to establish new connections through an adaptive process able to deal with dynamic changes in network state. By means of simulation we show that the algorithm leads to lower blocking probability and lower mean setup time than other distributed algorithms.