Routing and wavelength assignment in all-optical networks
IEEE/ACM Transactions on Networking (TON)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Wavelength requirements for multicasting in all-optical networks
IEEE/ACM Transactions on Networking (TON)
Algorithms for allocating wavelength converters in all-optical networks
IEEE/ACM Transactions on Networking (TON)
On optiml converter placement in wavelength-routed networks
IEEE/ACM Transactions on Networking (TON)
Multiwavelength Optical Networks: A Layered Approach
Multiwavelength Optical Networks: A Layered Approach
Virtual Source Based Multicast Routing in WDM Optical Networks
ICON '00 Proceedings of the 8th IEEE International Conference on Networks
Light trees: optical multicasting for improved performance in wavelength routed networks
IEEE Communications Magazine
Benefits of wavelength translation in all-optical clear-channel networks
IEEE Journal on Selected Areas in Communications
Wavelength conversion in WDM networking
IEEE Journal on Selected Areas in Communications
On-line optimal wavelength assignment in WDM networks with shared wavelength converter pool
IEEE/ACM Transactions on Networking (TON)
Optimal wavelength converter allocation: a new approach based MOEA
Proceedings of the 5th International Latin American Networking Conference
Photonic Network Communications
Hypercube communications on optical chordal ring networks with chord length of three
ACSAC'06 Proceedings of the 11th Asia-Pacific conference on Advances in Computer Systems Architecture
Connected set cover problem and its applications
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
The channel assignment algorithm on RP(k) networks
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
Wavelength assignment to lightpaths for minimal wavelength conversions in multihop WDM networks
Computer Communications
| Hi-index | 14.98 |
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 \subset DTIME(n^{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 ${\frac{1}{2}}\ln n$ is the best possible performance ratio unless $NP \subset DTIME(n^{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.