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

Learn More →

A tabu search heuristic for the routing and wavelength assignment problem in multigranular optical networks

A tabu search heuristic for the routing and wavelength assignment problem in multigranular... This paper proposes a tabu search heuristic for solving the routing and wavelength assignment problem in multigranular optical networks, considering the wavelength-continuity constraint and a set of connections to satisfy. For a number of fibers per link, a number of wavebands per fiber, and a number of wavelengths per waveband, this algorithm attempts to minimize the total number of ports used in the network by efficiently grouping lightpaths into bands and fibers, and switching the whole bands and fibers. The algorithm has been implemented and tested on the NSFNET network, and comparisons have been made with the Balanced Path Routing and Heavy Traffic First (BPHT) algorithm in terms of number of ports. Generally, the results obtained with our tabu search heuristic are better than those provided by this algorithm. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Photonic Network Communications Springer Journals

A tabu search heuristic for the routing and wavelength assignment problem in multigranular optical networks

Loading next page...
 
/lp/springer-journals/a-tabu-search-heuristic-for-the-routing-and-wavelength-assignment-JLRD5KY4WP

References (15)

Publisher
Springer Journals
Copyright
Copyright © 2007 by Springer Science+Business Media, LLC
Subject
Computer Science; Computer Communication Networks; Electrical Engineering; Characterization and Evaluation of Materials
ISSN
1387-974X
eISSN
1572-8188
DOI
10.1007/s11107-007-0111-0
Publisher site
See Article on Publisher Site

Abstract

This paper proposes a tabu search heuristic for solving the routing and wavelength assignment problem in multigranular optical networks, considering the wavelength-continuity constraint and a set of connections to satisfy. For a number of fibers per link, a number of wavebands per fiber, and a number of wavelengths per waveband, this algorithm attempts to minimize the total number of ports used in the network by efficiently grouping lightpaths into bands and fibers, and switching the whole bands and fibers. The algorithm has been implemented and tested on the NSFNET network, and comparisons have been made with the Balanced Path Routing and Heavy Traffic First (BPHT) algorithm in terms of number of ports. Generally, the results obtained with our tabu search heuristic are better than those provided by this algorithm.

Journal

Photonic Network CommunicationsSpringer Journals

Published: Dec 1, 2007

There are no references for this article.