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

Author

Wu, Qiwu ; Zhou, Xianwei ; Wang, Jianping ; Yin, Zhizhong ; Jiang, Lingzhi

Author_Institution

Dept. of Commun. Eng., Univ. of Sci. & Technol. Beijing, Beijing, China

fYear

2009

fDate

14-16 Aug. 2009

Firstpage

1

Lastpage

4

Abstract

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.

Keywords

costing; probability; telecommunication network routing; wavelength division multiplexing; K-shortest-path strategy; WDM networks; blocking probability; colored multigraph model; destination node; low-cost delay-constrained routing; sparse wavelength conversions; temporarily available wavelengths; wavelength assignment algorithm; Costs; IP networks; Network topology; Optical fiber devices; Optical wavelength conversion; Propagation delay; WDM networks; Wavelength assignment; Wavelength division multiplexing; Wavelength routing;

fLanguage

English

Publisher

ieee

Conference_Titel

Photonics and Optoelectronics, 2009. SOPO 2009. Symposium on

Conference_Location

Wuhan

Print_ISBN

978-1-4244-4412-0

Type

conf

DOI

10.1109/SOPO.2009.5230198

Filename

5230198