Abstract
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.
© 2009 OSA, IEEE Photonics Society, SPIE, COS, CIC
PDF ArticleMore Like This
Onur Turkcu and Suresh Subramaniam
OThQ4 Optical Fiber Communication Conference (OFC) 2008
Min Zhang, Bo Xu, Baojian Wu, Yun Ling, and Kun Qiu
Su2A.54 Asia Communications and Photonics Conference (ACP) 2017
Ankitkumar N. Patel, Philip N. Ji, Jason P. Jue, and Ting Wang
PDPWG1 Photonics in Switching (PS) 2010