Placement of Wavelength Converters

The number of wavelengths available in a network is always limited due to the restriction of hardware structure of optical routers/switches. An important goal of the design of WDM networks is to use less wavelengths to serve more communication needs. There are two basic approaches to achieving the goal. The first one is to find the proper routing and wavelength assignment methods, that is the routing and wavelength assignment problem (RWAP) discussed in Chapter 3. In this chapter we will focus on the second approach, that is to use of wavelength converters. Existing study has shown that the more converters installed in a network, the less number of wavelengths is needed, given the same network load (the maximal number of channels over a link). In fact, by using enough number of wavelength converters at the network nodes, the number of wavelengths required can be made equal to the network load, this is most ideal situation that we can expect since the number of wavelengths required in a system is no less than the network load. A simple example of achieving this feature, called the Load-Wavelength Assignability (LWA), is to equip every node in the network with a wavelength converter. However, it is too expensive to do so, because this will not only increase the cost of network hardware but also the complexity of routing and wavelength assignment.

[1]  Xiaohua Jia,et al.  OPTIMAL PLACEMENT OF WAVELENGTH CONVERTERS IN WDM NETWORKS FOR PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS , 2000 .

[2]  Deying Li,et al.  Placement of wavelength converters for minimal wavelength usage in WDM networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[3]  Ezhan Karasan,et al.  Effects of wavelength routing and selection algorithms on wavelength conversion gain in WDM optical networks , 1996, Proceedings of GLOBECOM'96. 1996 IEEE Global Telecommunications Conference.

[4]  Flaminia L. Luccio Almost Exact Minimum Feedback Vertex Set in Meshes and Butterflies , 1998, Inf. Process. Lett..

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

[6]  Stephen A. Cook,et al.  The complexity of theorem-proving procedures , 1971, STOC.

[7]  D. König Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre , 1916 .

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

[9]  Fanica Gavril,et al.  Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[10]  Piotr Berman,et al.  A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem , 1999, SIAM J. Discret. Math..

[11]  Amit Kumar,et al.  Wavelength conversion in optical networks , 1999, SODA '99.

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

[13]  Ewald Speckenmeyer,et al.  Ramsey numbers and an approximation algorithm for the vertex cover problem , 1985, Acta Informatica.

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