Traffic grooming in unidirectional WDM ring networks using genetic algorithms

Authors:
Yong Xu;Shen-Chu Xu;Bo-Xi Wu
Affiliations:
Department of Physics, Xiamen University, Xiamen 361005, People's Republic of China and Department of Physics, Fujian Normal University, Fuzhou 350007, People's Republic of China;Department of Physics, Xiamen University, Xiamen 361005, People's Republic of China;Department of Physics, Xiamen University, Xiamen 361005, People's Republic of China
Venue:
Computer Communications
Year:
2002

Citing 5
Cited 4

Routing and wavelength assignment with power considerations in optical networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
Architectural and technological issues for future optical Internet networks

IEEE Communications Magazine
An approach to wide area WDM optical network design using genetic algorithm

Computer Communications
Converter placement in all-optical networks using genetic algorithms

Computer Communications
Grooming of arbitrary traffic in SONET/WDM BLSRs

IEEE Journal on Selected Areas in Communications

Strictly nonblocking grooming of dynamic traffic in unidirectional SONET/WDM rings using genetic algorithms

Computer Networks: The International Journal of Computer and Telecommunications Networking
A new approach to improving the grooming performance with dynamic traffic in SONET rings

Computer Networks: The International Journal of Computer and Telecommunications Networking
Computational intelligence in photonics technology and optical networks: A survey and future perspectives

Information Sciences: an International Journal
Reconfigurable grooming of dynamic traffic in SONET/WDM ring networks

Journal of High Speed Networks

Quantified Score

Hi-index	0.24

Visualization

Abstract

We propose a genetic algorithm (GA) with (@m+@l)-strategy to solve the traffic grooming problems in unidirectional SONET/WDM rings with arbitrary asymmetric traffic requirements. The objective is to optimally assign calls to wavelengths in order that the total number of SONET add/drop multiplexers (ADMs) is minimized while as few wavelengths as possible are used. We derive the theoretical lower and upper bounds on the numbers of both ADMs and wavelengths and summarize the general properties of the asymmetric traffic requirements in the ring. In applying GAs to solve the problem, we develop an order-based representation for the chromosome, introduce the concept of adaptive chromosome and propose a first fit approach incorporated with a greedy improvement algorithm to decode it. The order-mapped crossover and the inversion mutation are used to produce offspring. We also introduce the concept of the weighted average traversing length of each traffic and investigate the dependence of the average number of nodes at which per wavelength drops on both the weighted average traversing length and the average traffic requirement between each pair of nodes. Computer simulation results show that the algorithm proposed in this paper can significantly reduce the number of ADMs in solving the arbitrary asymmetric traffic grooming problems. A digital example shows that all the calls in the ring are nearly neatly paired after grooming.