5 October 2000 Wavelength assignment problem in multifiber optical tree networks
Author Affiliations +
This paper studies the off-line wavelength assignment problem in tree optical networks that use multiple fibers in each link. In the multifiber scenario, the wavelength assignment is potentially more flexible because the same wavelength can be carried simultaneously on parallel links. However, in tree networks, our results unfortunately show that multiple fibers do not fundamentally improve problem complexity nor do they decrease the worst-case bound based on the request load. For multifiber directed or undirected binary trees, we show that the wavelength assignment problem (WAP) is NP-complete. In contract, there is a polynomial algorithm for undirected single-fiber binary trees. If path lengths are restricted to at most three, WAP in dual-fiber undirected tree networks is still NP-complete whereas if path lengths are restricted to four, WAP is any multifiber directed or undirected tree network is NP-complete. Finally, we show a tight upper bound of 3Lmax/(2k) wavelengths per fiber for any k-fiber undirected tree where L is the connection load.
© (2000) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Guangzhi Li, Guangzhi Li, Rahul Simha, Rahul Simha, } "Wavelength assignment problem in multifiber optical tree networks", Proc. SPIE 4213, Terabit Optical Networking: Architecture, Control, and Management Issues, (5 October 2000); doi: 10.1117/12.402532; https://doi.org/10.1117/12.402532


Minimal cost WDM network for incremental traffic
Proceedings of SPIE (August 24 1999)
Predesigned protection scheme for WDM ring networks
Proceedings of SPIE (October 04 2000)
Revenue maximization in survivable WDM networks
Proceedings of SPIE (September 21 2000)

Back to Top