Wavelength Conversion in All-Optical Networks with Shortest-Path Routing

Abstract

We consider all-optical networks with shortest-path routing that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their capacity usage. We present efficient algorithms for deciding whether a placement of wavelength converters allows the network to run at maximum capacity, and for finding an optimal wavelength assignment when such a placement of converters is known. Our algorithms apply to both undirected and directed networks. Furthermore, we show that the problem of designing such networks, i.e., finding an optimal placement of converters, is MAX SNP-hard in both the undirected and the directed case. Finally, we give a linear-time algorithm for finding an optimal placement of converters in undirected triangle-free networks, and show that the problem remains N P-hard in bidirected triangle-free planar networks.

On the Complexity of the Regenerator Placement Problem in Optical Networks

“…In addition, in [17], regenerators with slightly different capabilities are considered. Finally, other papers (see, e.g., [7], [10], and [18]) studied related problems dealing with hardware optimization in optical networks with wavelength conversion. An all-optical network is also called a transparent optical network, and the opposite of a transparent optical network is the opaque optical network (see, e.g., [2] and [14]).…”