By Topic

A Low-Cost Delay-Constrained Routing and Wavelength Assignment Algorithm in WDM Networks with Sparse Wavelength Conversions

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

5 Author(s)
Qiwu Wu ; Dept. of Commun. Eng., Univ. of Sci. & Technol. Beijing, Beijing, China ; Xianwei Zhou ; Jianping Wang ; Zhizhong Yin
more authors

In this paper, we propose a colored multigraph model for the temporarily available wavelengths. Based on this colored multigraph model, a low-cost delay-constrained routing algorithm is proposed by applying the K-shortest-path strategy. The proposed algorithm has the following advantages: (1) finish routing and wavelength assignment in one step; (2) the total cost of lightpath is low; (3) the delay from the source node to the destination node is bounded. Simulation results show that the proposed algorithm works well and achieves satisfactory blocking probability.

Published in:

Photonics and Optoelectronics, 2009. SOPO 2009. Symposium on

Date of Conference:

14-16 Aug. 2009