On the optimal placement of wavelength converters in WDM networks

An important goal of the design of wavelength division multiplexing (WDM) networks is to use less wavelengths to serve more communication needs. According to the wavelength conflict rule, we know that the number of wavelengths required in a WDM network is at least equal to the maximal number of channels over a fiber (called maximal link load) in the network. By placing wavelength converters at some nodes in the network, the number of wavelengths needed can be made equal to the maximal link load. In this paper, we study the problem of placing the minimal number of converters in a network to achieve that the number of wavelengths in use is equal to the maximal link load. For duplex communication channels, we prove that the optimal solution can be obtained in polynomial-time. For unidirectional communication channels, which was proved to be NP-complete, we develop a set of lemmas which lead to a simple approximation algorithm whose theoretically guaranteed performance ratio is at most two.

[1]  Byrav Ramamurthy,et al.  Wavelength conversion in WDM networking , 1998, IEEE J. Sel. Areas Commun..

[2]  Arun K. Somani,et al.  An efficient algorithm for optimal wavelength converter placement on wavelength-routed networks with arbitrary topologies , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[3]  Rajiv Ramaswami,et al.  Multiwavelength optical networks with limited wavelength conversion , 1998, TNET.

[4]  Gaoxi Xiao,et al.  Algorithms for allocating wavelength converters in all-optical networks , 1999, TNET.

[5]  Carla D. Savage,et al.  Depth-First Search and the Vertex Cover Problem , 1982, Inf. Process. Lett..

[6]  Jaafar M. H. Elmirghani,et al.  All-optical wavelength conversion: technologies and applications in DWDM networks , 2000, IEEE Commun. Mag..

[7]  Dorit S. Hochba,et al.  Approximation Algorithms for NP-Hard Problems , 1997, SIGA.

[8]  Emmanouel Varvarigos,et al.  An analysis of limited wavelength translation in regular all-optical WDM networks , 2000, Journal of Lightwave Technology.

[9]  K. R. Venugopal,et al.  A heuristic for placement of limited range wavelength converters in all-optical networks , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[10]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[11]  B. Mukherjee,et al.  WDM-based local lightwave networks. I. Single-hop systems , 1992, IEEE Network.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[14]  Jennifer Yates,et al.  Limited-range wavelength translation in all-optical networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[15]  Eli Upfal,et al.  Efficient routing in all-optical networks , 1994, STOC '94.

[16]  Suresh Subramaniam,et al.  Connectivity and sparse wavelength conversion in wavelength-routing networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[17]  Robert Cole,et al.  Computer Communications , 1982, Springer New York.

[18]  Peter Winkler,et al.  Ring routing and wavelength translation , 1998, SODA '98.

[19]  B. Mukherjee,et al.  WDM-based local lightwave networks. II. Multihop systems , 1992, IEEE Network.