Near Optimal Design of Lightpath Routing and Wavelength Assignment in Purely Optical WDM Networks

Abstract

This paper proposes the optimal design of lightpath Routing and Wavelength Assignment (RWA) problem in Wavelength Division Multiplexing (WDM) networks without wavelength conversion. We formulate RWA as a mixed Integer Linear Programming (ILP) problem where the objective is to minimize the cost of wavelength assignment to the fiber links in the network. The Lagrangean relaxation technique and the optimization-based heuristics are used to solve this problem. Two sets of computational experiments are performed to test the algorithms for the maximum carried traffic and minimum wavelength requirements in three different network topologies (GTE, ARPA, OCT network). Based on solution quality to the computational experiments, the error gaps between the upper bound and the lower bound are close enough that the near optimal solutions could be obtained. On the other hand, we also show that the solution quality degrade gracefully under more and more heavy traffic network environment. By assessing solution quality and the computational time, we propose the efficient and effective optimization-based algorithms based on the Lagrangean relaxation method for the RWA problem in the WDM networks without wavelength conversion.