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(N2) 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
(060.0060) Fiber optics and optical communications : Fiber optics and optical communications
(060.4251) Fiber optics and optical communications : Networks, assignment and routing algorithms
(060.4265) Fiber optics and optical communications : Networks, wavelength routing
Q. Wu, J. Wang, X. Zhou, L. Jiang, and Y. Deng, "A Novel Routing and Wavelength Assignment Algorithm Based on Colored Multigraph Model in WDM Networks," in Asia Communications and Photonics Conference and Exhibition, Technical Digest (CD) (Optical Society of America, 2009), paper WL75.