Algorithms for designing WDM networks and grooming the traffic

Authors:
Abderraouf Bahri;Steven Chamberland
Affiliations:
Department of Computer Engineering, École Polytechnique de Montréal, Montréal, Québec, Canada;Department of Computer Engineering, École Polytechnique de Montréal, Montréal, Québec, Canada
Venue:
ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Year:
2007

Citing 4
Cited 0

Tabu Search

Tabu Search
A novel generic graph model for traffic grooming in heterogeneous WDM mesh networks

IEEE/ACM Transactions on Networking (TON)
Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths

Computers and Operations Research
Traffic grooming in WDM networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a model for the global design problem of wavelength division multiplexing (WDM) networks including the traffic grooming. This problem consists in finding the number of fibers between each pair of node, selecting the configuration of each node, choosing the set of lightpaths (i.e., the virtual topology), routing these lightpaths over the physical topology and finally, grooming and routing the traffic over the lightpaths. Since this problem is NP-hard, we propose heuristic algorithms and a tabu search metaheuristic algorithm to find good solutions for real-size instances rapidly.