Paper
19 November 2009 A novel routing and wavelength assignment algorithm based on colored multigraph model in WDM networks
Qiwu Wu, Jianping Wang, Xianwei Zhou, Lingzhi Jiang, Yu Deng
Author Affiliations +
Proceedings Volume 7633, Network Architectures, Management, and Applications VII; 76331Q (2009) https://doi.org/10.1117/12.851272
Event: Asia Communications and Photonics, 2009, Shanghai, Shanghai , China
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(N2) 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.
© (2009) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Qiwu Wu, Jianping Wang, Xianwei Zhou, Lingzhi Jiang, and Yu Deng "A novel routing and wavelength assignment algorithm based on colored multigraph model in WDM networks", Proc. SPIE 7633, Network Architectures, Management, and Applications VII, 76331Q (19 November 2009); https://doi.org/10.1117/12.851272
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Wavelength division multiplexing networks

Wavelength division multiplexing

Computer simulations

Algorithm development

Optical networks

Network architectures

Optical fibers

Back to Top