Abstract
Given a WDM optical network with wavelength channels on its fiber links, we consider the problem of finding the minimum set of network nodes such that, with wavelength converters at these nodes, broadcast can be supported in the network. We call this problem the converter placement problem. We model a given network using a graph G with colors on its edges and give a mathematical formulation for the problem based on the graph model. Two related problems, color-covering and vertex color-covering, are given and analyzed. Both of them are shown to have a polynomial-time approximation with performance ratio ln n+1 and ln n is the best possible performance ratio unless NP /spl sub/ DTIME(n/sup poly log n/), where n is the number of vertices in G. Using these results, we show that the Converter Placement problem has a polynomial-time approximation with performance ratio 2(ln n+1) and 1/2 ln n is the best possible performance ratio unless NP /spl sub/ DTIME(n/sup poly log n/). We present an approximation algorithm to solve the converter placement problem and study the performance of the algorithm on randomly generated network topologies.
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.
