By Topic

An algorithm for traffic grooming in WDM optical mesh networks with multiple objectives

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Prathombutr, P. ; Sch. of Interdisciplinary Comput. & Eng., Missouri Univ., Kansas City, MO, USA ; Stach, J. ; Park, E.K.

This paper studies a traffic grooming in wavelength-division multiplexing (WDM) mesh networks for the SONET/SDH streams requested between node pairs. The traffic could be groomed at the access node before converting to an optical signal carried in the all-optical network. We design a virtual topology with a given physical topology to satisfy multiple objectives and constraints. The grooming problem of a static demand is considered as an optimization problem. The algorithms found in the literatures focus on a single objective either to maximize the performance or to minimize the cost. We propose a multiobjective evolutionary algorithm to solve a grooming problem that optimizes multiple objectives all together at the same time. In this paper we consider the optimization of three objectives: maximize the traffic throughput, minimize the number of transceivers, and minimize the average propagation delay or average hop counts. The simulation results show that our approach is superior to an existing heuristic approaches for the 6-node benchmark network in an acceptable running time.

Published in:

Computer Communications and Networks, 2003. ICCCN 2003. Proceedings. The 12th International Conference on

Date of Conference:

20-22 Oct. 2003