Share Email Print

Proceedings Paper

The analysis in the problem of strictly non-blocking grooming of dynamic traffics in WDM tree networks using genetic algorithms
Author(s): Min Cheng; Xuemei Li; Yuliang Li; Yingwu Zhou; Xiyao Chen
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper 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.

Paper Details

Date Published: 19 November 2007
PDF: 8 pages
Proc. SPIE 6784, Network Architectures, Management, and Applications V, 678434 (19 November 2007); doi: 10.1117/12.736642
Show Author Affiliations
Min Cheng, Minjiang Univ. (China)
Xuemei Li, Minjiang Univ. (China)
Yuliang Li, Minjiang Univ. (China)
Yingwu Zhou, Minjiang Univ. (China)
Xiyao Chen, Minjiang Univ. (China)

Published in SPIE Proceedings Vol. 6784:
Network Architectures, Management, and Applications V
Jianli Wang; Gee-Kung Chang; Yoshio Itaya; Herwig Zech, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?