Optimal routing and wavelength assignment in WDM ring networks

Authors:
Taehan Lee;K. Lee;Sungsoo Park
Affiliations:
Dept. of Ind. Eng., Korea Adv. Inst. of Sci. & Technol., Seoul, South Korea;-;-
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2006

Citing 0
Cited 10

A novel dynamic fault restoration mechanism using cluster allocation approach in WDM mesh networks

Computer Communications
A hybrid method for solving ARWA problem on WDM network

Computer Communications
Genetic algorithm for finding minimal cost light forest of multicast routing on WDM networks

Journal of Artificial Evolution and Applications - Regular issue
On column generation formulations for the RWA problem

Discrete Applied Mathematics
Genetic algorithm for finding minimal cost light-forest of multicast routing on WDM networks

Artificial Intelligence Review
Optimal routing and wavelength assignment to minimize the number of SONET ADMs in WDM rings

Photonic Network Communications
Flow admission control for multi-channel multi-radio wireless networks

Wireless Networks
Comparison of routing methods in optical multicast WDM ring networks

Photonic Network Communications
Review: Comparison of ILP formulations for the RWA problem

Optical Switching and Networking
Genetic algorithms for multiple multicast on WDM ring network

Computer Communications

Quantified Score

Hi-index	0.07

Visualization

Abstract

We consider the routing and wavelength assignment (RWA) problem on WDM ring networks without wavelength conversion. When the physical network and required connections are given, RWA is the problem to select a suitable path and wavelength among the many possible choices for each connection such that no two paths using the same wavelength pass through the same link. We give an integer programming formulation of the problem and propose an algorithm to solve it. Although the formulation has exponentially many variables, we solve the linear programming relaxation of it by using the column generation technique. We solve the column generation problem efficiently by decomposing the problem into several subproblems. After solving the linear programming relaxation, we apply the branch-and-price procedure to get an optimal solution. We test the proposed algorithm on some randomly generated data. Test results show that the algorithm gives optimal solutions to almost all instances under the given node limit of the branch-and-bound tree.