An Improved Ant Colony Based Algorithm for Dynamic Routing and Wavelength Assignment Scheme in Optical Networks

DOI

10.2991/iccasm.2012.17How to use a DOI?

Keywords

Intelligent Optical Network,Routing and Wavelength Assignment,Ant Colony Algorithm,Blocking Probability, Resource Utilization

Abstract

Dynamic routing and wavelength assignment (RWA) is a key problem in intelligent optical networks. This paper presents an improved ant colony algorithm to solve the RWA problem which introduced link idle as constraint into the ant transition probability. At the same time, the random disturbance is added to prevent premature convergence into local optimal path. Simulation shows that the modified algorithm decreases the blocking probability and increases the resources utilization comparing with the traditional Dijkstra+FF algorithm, respectively.

Copyright

© 2012, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Jianhua Shen
AU  - Xi Cheng
PY  - 2012/08
DA  - 2012/08
TI  - An Improved Ant Colony Based Algorithm for Dynamic Routing and Wavelength Assignment Scheme in Optical Networks
BT  - Proceedings of the 2012 International Conference on Computer Application and System Modeling (ICCASM 2012)
PB  - Atlantis Press
SP  - 69
EP  - 71
SN  - 1951-6851
UR  - https://doi.org/10.2991/iccasm.2012.17
DO  - 10.2991/iccasm.2012.17
ID  - Shen2012/08
ER  -