Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Grooming of Arbitrary Traffic in Optical WDM Mesh Networks Using a Genetic Algorithm

Grooming of Arbitrary Traffic in Optical WDM Mesh Networks Using a Genetic Algorithm In this paper, a genetic algorithm is proposed for grooming of arbitrary traffic in optical mesh networks. Traffic streams are routed in the wavelength division multiplexing (WDM) grooming networks that comprise both fiber links and established lightpaths. Chromosomes are split into multiple versions when multiple shortest routes are found. The selection strategy is based on a comparison between chromosomes. A variety of cost functions are proposed for the routing algorithm and two comparison methods are considered in the selection procedure. Computer simulations are performed with randomly generated traffic patterns. The results show that the algorithm is effective for traffic grooming (TG) problems, and also for routing and wavelength assignment problems. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Photonic Network Communications Springer Journals

Grooming of Arbitrary Traffic in Optical WDM Mesh Networks Using a Genetic Algorithm

Loading next page...
 
/lp/springer-journals/grooming-of-arbitrary-traffic-in-optical-wdm-mesh-networks-using-a-03c8FsoF8i

References (7)

Publisher
Springer Journals
Copyright
Copyright © 2005 by Springer Science+Business Media, Inc.
Subject
Computer Science; Computer Communication Networks; Electrical Engineering; Characterization and Evaluation of Materials
ISSN
1387-974X
eISSN
1572-8188
DOI
10.1007/s11107-005-2483-3
Publisher site
See Article on Publisher Site

Abstract

In this paper, a genetic algorithm is proposed for grooming of arbitrary traffic in optical mesh networks. Traffic streams are routed in the wavelength division multiplexing (WDM) grooming networks that comprise both fiber links and established lightpaths. Chromosomes are split into multiple versions when multiple shortest routes are found. The selection strategy is based on a comparison between chromosomes. A variety of cost functions are proposed for the routing algorithm and two comparison methods are considered in the selection procedure. Computer simulations are performed with randomly generated traffic patterns. The results show that the algorithm is effective for traffic grooming (TG) problems, and also for routing and wavelength assignment problems.

Journal

Photonic Network CommunicationsSpringer Journals

Published: May 26, 2005

There are no references for this article.