Share Email Print
cover

Proceedings Paper

A novel routing and wavelength assignment algorithm based on colored multigraph model in WDM networks
Author(s): Qiwu Wu; Jianping Wang; Xianwei Zhou; Lingzhi Jiang; Yu Deng
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 19 November 2009
PDF: 10 pages
Proc. SPIE 7633, Network Architectures, Management, and Applications VII, 76331Q (19 November 2009); doi: 10.1117/12.851272
Show Author Affiliations
Qiwu Wu, Univ. of Science and Technology Beijing (China)
Jianping Wang, Univ. of Science and Technology Beijing (China)
Xianwei Zhou, Univ. of Science and Technology Beijing (China)
Lingzhi Jiang, Univ. of Science and Technology Beijing (China)
Yu Deng, Univ. of York (United Kingdom)


Published in SPIE Proceedings Vol. 7633:
Network Architectures, Management, and Applications VII
Ken-ichi Sato; Lena Wosinska; Jing Wu; Yuefeng Ji, Editor(s)

© SPIE. Terms of Use
Back to Top