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

Authors:
Steven Chamberland;Désiré Oulaï Khyda;Samuel Pierre
Affiliations:
CRT and Computer Engineering Department, École Polytechnique de Montréal, C.P. 6079, Succ. Centre-Ville, Montréal, Que H3C 3A7, Canada;Computer Engineering Department, École Polytechnique de Montréal, C.P. 6079, Succ. Centre-Ville, Montréal Que H3C 3A7, Canada;Computer Engineering Department, École Polytechnique de Montréal, C.P. 6079, Succ. Centre-Ville, Montréal Que H3C 3A7, Canada
Venue:
Computers and Operations Research
Year:
2005

Citing 7
Cited 3

New methods to color the vertices of a graph

Communications of the ACM
Efficient algorithms for routing dependable connections in WDM optical networks

IEEE/ACM Transactions on Networking (TON)
Multiwavelength Optical Networks: A Layered Approach

Multiwavelength Optical Networks: A Layered Approach
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Co-evolutionist Meta-heuristic for the Assignment of the Frequencies in Cellular Networks

Proceedings of the EvoWorkshops on Applications of Evolutionary Computing
Wavelength Routing and Assignment in a Survivable WDM Mesh Network

Operations Research
Optimal design and evaluation of survivable WDM transport networks

IEEE Journal on Selected Areas in Communications

A global approach for designing reliable WDM networks and grooming the traffic

Computers and Operations Research
Algorithms for designing WDM networks and grooming the traffic

ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Algorithms for the global design of WDM networks including the traffic grooming

Optical Switching and Networking

Quantified Score

Hi-index	0.02

Visualization

Abstract

In this paper, we tackle the routing and wavelength assignment problem for wavelength division multiplexing (WDM) networks containing permanent and reliable wavelength paths (WPs). It consists of finding the route and the wavelength of each WP for the normal state of the network and for the important failure scenarios. These scenarios might be the most probable failure scenarios or simply the failure scenarios of interest to the network planner (e.g., the single link failure scenarios). We propose a mathematical programming model for this problem. In order to find a solution within a reasonable amount of time, a simple heuristic algorithm is proposed. The results show that "good" solutions can be obtained with the proposed heuristic algorithm.