In this paper, 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<sup>2</sup>) is also proposed to develop an integrated dynamic routing and wavelength assignment, where N is the number of nodes in a WDM network.

© OSA, IEEE Photonics Society, SPIE, COS, CIC

PDF Article