Algorithms for the global design of WDM networks including the traffic grooming

Authors:
Abderraouf Bahri;Steven Chamberland
Affiliations:
Department of Computer Engineering, ícole Polytechnique de Montréal, C.P. 6079, Succ. Centre-Ville Montréal, Québec, Canada H3C 3A7;Department of Computer Engineering, ícole Polytechnique de Montréal, C.P. 6079, Succ. Centre-Ville Montréal, Québec, Canada H3C 3A7
Venue:
Optical Switching and Networking
Year:
2007

Citing 7
Cited 1

Optical Networking & WDM

Optical Networking & WDM
Tabu Search

Tabu Search
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
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
Traffic grooming in an optical WDM mesh network

IEEE Journal on Selected Areas in Communications

Performance analysis of an optical network employing waveband and traffic grooming

Photonic Network Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a model and algorithms for the global design problem of wavelength division multiplexing (WDM) networks including the traffic grooming. This problem consists in finding the number of fibres between each pair of nodes (i.e. the physical topology), finding the number of transponders at 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 two heuristic algorithms and a tabu search metaheuristic algorithm to find solutions for real-size instances within a reasonable amount of computational time.