Abstract
In wavelength routed optical networks, wavelength converters can potentially reduce the requirement on the number of wavelengths. The problem of placing a minimum number of wavelength converters in a WDM network so that any routing can be satisfied using no more wavelengths than if there were wavelength converters at every node was raised by Wilfong and Winkler (1998) as the minimum sufficient set problem. This problem is NP-complete in general WDM networks. Wan et al. (1999), showed that the problem is tractable if every edge in the network is bi-directed and the skeleton of the network is a tree of rings. We show that the minimum sufficient set problem is tractable in any directed graph with a general tree of rings skeleton.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
