By Topic

Optimal routing and wavelength assignment in WDM ring networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Taehan Lee ; Dept. of Ind. Eng., Korea Adv. Inst. of Sci. & Technol., Seoul, South Korea ; Lee, K. ; Sungsoo Park

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.

Published in:

Selected Areas in Communications, IEEE Journal on  (Volume:18 ,  Issue: 10 )