By Topic

Priority and Maximum Revenue based Routing and Wavelength Assignment for All-optical WDM 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)
Ying Wang ; Sch. of EEE, Nanyang Technol. Univ., Singapore ; Tee Hiang Cheng ; Maode Ma

Static routing and wavelength assignment (RWA) is usually formulated as an optimization problem with the objective of minimizing wavelength channel usage or maximizing the number of connections established. In this paper, we formulate it as a priority and maximum revenue (MR) based optimization problem, which we believe will be more appealing to network operators. We describe an integer linear programming (ILP) solution which can be used to find the optimal solution for small networks. We also describe a simplified ILP (SILP) solution which can be used for both small and large networks. By means of computer simulations, the performance of the two ILP solutions are compared with the sequential R WA (SR) algorithm which we devise to mimic those algorithms commonly used for solving the maximum lightpath establishment (MLE) problem. Our results show that SILP outperforms SR significantly, and yields solutions close to the optimal solution obtained from ILP.

Published in:

Research, Innovation and Vision for the Future, 2007 IEEE International Conference on

Date of Conference:

5-9 March 2007