Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths

DOI10.1016/J.COR.2003.09.013zbMath1075.90008OpenAlexW2010038548MaRDI QIDQ2485164

Steven Chamberland, Désiré Oulaï Khyda, Samuel Pierre

Publication date: 3 August 2005

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2003.09.013

zbMATH Keywords

Heuristic algorithmWavelength division multiplexingWavelength assignmentMathematical modelOptical network planningWavelength path routing

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Related Items (2)

A global approach for designing reliable WDM networks and grooming the traffic ⋮ Genetic algorithm and tabu search algorithm for solving the static manycast RWA problem in optical networks

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topological design of survivable mesh-based transport networks
• Hybrid evolutionary algorithms for graph coloring
• Wavelength Routing and Assignment in a Survivable WDM Mesh Network
• New methods to color the vertices of a graph
• Performance analysis under dynamic loading of wavelength continuous and non-continuous WDM networks with shortest-path routing

This page was built for publication: Joint routing and wavelength assignment in wavelength division multiplexing networks for permanent and reliable paths