By Topic

Toward optimal routing of lightpaths in dynamic 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

2 Author(s)
Pin-Han Ho ; Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada ; Mouftah, H.T.

This paper provides an approximate optimal routing algorithm, called relax-converter-first (RCF), for dynamic WDM (wavelength division multiplexing) networks with heterogeneous and partial wavelength conversion capability in each node. The algorithm can derive an optimal solution if the cost of consuming a wavelength converter is set much smaller than is the case for taking a wavelength channel. We propose a wavelength graph technique along with a modified Dijkstra's shortest path first algorithm. Simulation is conducted to verify the performance in terms of blocking probability focusing on the following two themes: first, a comparison in performance is conducted among the cases of using fixed alternate routing, shortest path first algorithm with wavelength graph (SPAWG), and RCF. Second, the performance of using the RCF scheme is examined with different cost of taking a wavelength converter in network nodes with different wavelength conversion capability. We also provide the simulation statistics about the optimality in using the RCF scheme under different network environments.

Published in:

Parallel Processing Workshops, 2003. Proceedings. 2003 International Conference on

Date of Conference:

6-9 Oct. 2003