A novel routing and wavelength assignment algorithm based on colored multigraph model in WDM networks

Author

Wu, Qiwu ; Wang, Jianping ; Zhou, Xianwei ; Jiang, Lingzhi ; Deng, Yu

Author_Institution

School of Information Engineering, University of Science and Technology Beijing, 100083, China

Volume

2009-Supplement

fYear

2009

fDate

2-6 Nov. 2009

Firstpage

1

Lastpage

10

Abstract

In this paper, the problem of integrated routing and wavelength assignment in wavelength division multiplexing (WDM) networks is studied. We propose a colored multigraph model for the temporarily available wavelengths. Based on this colored multigraph model, a polynomial time algorithm with complexity O(N²) is also proposed to develop an integrated dynamic routing and wavelength assignment, where N is the number of nodes in a WDM network. Simulation results show that the proposed algorithm achieves lower the connecting blocking probability than the existing ones.

Keywords

Bandwidth; Joining processes; Optical fiber networks; Optical fibers; Optical wavelength conversion; Polynomials; WDM networks; Wavelength assignment; Wavelength division multiplexing; Wavelength routing; WDM networks; colored multigraph model; lightpath; routing and wavelength assignment;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications and Photonics Conference and Exhibition (ACP), 2009 Asia

Conference_Location

Shanghai, China

Print_ISBN

978-1-55752-877-3

Electronic_ISBN

978-1-55752-877-3

Type

conf

Filename

5405452