Share Email Print

Optical Engineering

Adaptive evolutionary algorithm for traffic grooming in wavelength-division multiplexing networks
Author(s): Yi-shi Han; Bin Xu; Zhan-bin Ao; Xiao-dong Rao
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

We study the traffic grooming problems in wavelength-division multiplexing (WDM) networks with arbitrary topologies (such as the ring or mesh WDM network), aiming to improve the throughput and minimize the blocking probability in the network. The grooming problem is formulated as an optimization problem in the network, and the optimizing solution consists of three parts of design: the virtual topology, the route of the lightpaths, and the assignment of the wavelengths to the lightpaths. An evolutionary algorithm, named adaptive immune evolutionary algorithm was proposed. The feature of the proposed algorithm is in introducing the adaptive parameters so as to avoid premature convergence and enhance searching efficiency toward its solution. Experimental results and comparison with two well-known algorithms show that the proposed algorithm has better resource utilization for random traffic grooming in WDM networks.

Paper Details

Date Published: 1 March 2010
PDF: 8 pages
Opt. Eng. 49(3) 035003 doi: 10.1117/1.3362895
Published in: Optical Engineering Volume 49, Issue 3
Show Author Affiliations
Yi-shi Han, Guangdong Univ. of Technology (China)
Bin Xu, Guangdong Univ. of Technology (China)
Zhan-bin Ao, Guangdong Univ. of Technology (China)
Xiao-dong Rao, Guangdong Univ. of Technology (China)

© SPIE. Terms of Use
Back to Top