19 November 2007 The analysis in the problem of strictly non-blocking grooming of dynamic traffics in WDM tree networks using genetic algorithms
Author Affiliations +
Proceedings Volume 6784, Network Architectures, Management, and Applications V; 678434 (2007) https://doi.org/10.1117/12.736642
Event: Asia-Pacific Optical Communications, 2007, Wuhan, China
Abstract
We first propose the genetic algorithms (GA) to deal with strictly non-blocking grooming problems in optical tree networks. We describe strictly non-blocking grooming problems in Wavelength Division Multiplexing (WDM) optical trees with traffics and find the lower and upper bounds. Here we use the (μ + λ)-strategy to produce offspring for the genetic algorithm, and apply the technology of wavelengths-reuse in the decoding of the individual in the genetic algorithms. The performance of the proposed strictly non-blocking grooming algorithm was tested in tree networks with different granularity and different number of traffic patterns. Computer simulation results show that our algorithm can achieve very good results in saving both ADM's and wavelength in tree networks.
© (2007) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Min Cheng, Min Cheng, Xuemei Li, Xuemei Li, Yuliang Li, Yuliang Li, Yingwu Zhou, Yingwu Zhou, Xiyao Chen, Xiyao Chen, "The analysis in the problem of strictly non-blocking grooming of dynamic traffics in WDM tree networks using genetic algorithms", Proc. SPIE 6784, Network Architectures, Management, and Applications V, 678434 (19 November 2007); doi: 10.1117/12.736642; https://doi.org/10.1117/12.736642
PROCEEDINGS
8 PAGES


SHARE
RELATED CONTENT


Back to Top