On the joint link dimensioning and routing metric assignment problem for reliable WDM networks

Authors:
Steven Chamberland
Affiliations:
CRT and Computer Engineering Department, ícole Polytechnique de Montréal, C.P. 6079, Succ. Centre-Ville Montréal (Québec), Canada H3C 3A7
Venue:
Computers and Electrical Engineering
Year:
2004

Citing 5
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Tabu Search

Tabu Search
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
Optimizing OSPF/IS-IS weights in a changing world

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we tackle the joint link dimensioning and routing metric assignment problem for reliable wavelength division multiplexing (WDM) networks. This design problem consists to find the number of wavelength channels on each link and the routing metrics (considering shortest-path routing) that ensure the routing of all virtual wavelength paths (VWPs) and the successful rerouting of the reliable VWPs for all failure scenarios of interest to the network planner. A mixed integer mathematical programming model is proposed for the problem. The model is adapted for the single link failure scenarios. Since the problem is NP-hard, we propose a tabu search algorithm to obtain good approximate solutions for real-size instances of the problem. Finally, a lower bound is proposed and numerical results are presented and analyzed.