By Topic

Solving the routing and wavelength assignment problem in WDM networks for future planning

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

1 Author(s)
Hindam, T. ; Comput. Eng. Dept., Cairo Univ., Cairo, Egypt

In this article we define and analyze the routing and wavelength assignment problem by applying a virtual topology for both the optical network and the light paths. We introduce our developed algorithm to solve offline RWA problem. First the light path requests are constrained to repeated uniform distributed traffic. The reason is that this constraint permits us to study and analyze the behavior of the RWA problem. In addition, this constraint could be used as a benchmark to compare different algorithms. Then we relax the requests constraint to be non-uniform traffic. We show that the maximum number of assigned wavelengths depends on the number of traversed links, not on the shortest path length. Theorems are derived with proof to justify our algorithm. The effect of adding supplementary links to the WDM optical network is also explained to show how this approach could be used in the future planning for online operation. Finally, the result shows significant different in the number of wavelengths used compared to a recent backbone implemented network.

Published in:

Communications Magazine, IEEE  (Volume:47 ,  Issue: 8 )