Heuristic Algorithms for Grooming of Arbitrary Traffic in WDM Ring Networks

Heuristic Algorithms for Grooming of Arbitrary Traffic in WDM Ring Networks In a wavelength division multiplexing (WDM) network, sub-wavelength traffic streams can be elaborately arranged in wavelength channels to minimize the number of required electronic end systems, known as the traffic grooming problem. In this paper, a modified genetic algorithm without crossover operation is proposed to solve the problem using a permutation-based chromosome representation and using a selection strategy of reproducing the best chromosomes, thereby minimizing the number of electronic devices and requiring less wavelengths. Then, three methods are developed to improve the performance of the algorithm and a hill-climbing algorithm is proposed for the same purpose. Computer simulations were performed with plenty of randomly generated traffic patterns in unidirectional rings. The results show that these methods can improve the algorithm considerably. The relationships between the minimized network cost and the number of nodes are also presented. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Photonic Network Communications Springer Journals

Heuristic Algorithms for Grooming of Arbitrary Traffic in WDM Ring Networks

Loading next page...
 
/lp/springer_journal/heuristic-algorithms-for-grooming-of-arbitrary-traffic-in-wdm-ring-K3S7E94wNa
Publisher
Springer Journals
Copyright
Copyright © 2004 by Kluwer Academic Publishers
Subject
Computer Science; Computer Communication Networks; Electrical Engineering; Characterization and Evaluation of Materials
ISSN
1387-974X
eISSN
1572-8188
D.O.I.
10.1023/B:PNET.0000041240.50902.5b
Publisher site
See Article on Publisher Site

Abstract

In a wavelength division multiplexing (WDM) network, sub-wavelength traffic streams can be elaborately arranged in wavelength channels to minimize the number of required electronic end systems, known as the traffic grooming problem. In this paper, a modified genetic algorithm without crossover operation is proposed to solve the problem using a permutation-based chromosome representation and using a selection strategy of reproducing the best chromosomes, thereby minimizing the number of electronic devices and requiring less wavelengths. Then, three methods are developed to improve the performance of the algorithm and a hill-climbing algorithm is proposed for the same purpose. Computer simulations were performed with plenty of randomly generated traffic patterns in unidirectional rings. The results show that these methods can improve the algorithm considerably. The relationships between the minimized network cost and the number of nodes are also presented.

Journal

Photonic Network CommunicationsSpringer Journals

Published: Dec 27, 2004

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create lists to
organize your research

Export lists, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off