Wavelength Conversion in Shortest-Path All-Optical Networks

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 finding an optimal placement of converters is MAX SNP-hard in both undirected and directed networks. 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 NP-hard in bidirected triangle-free planar networks.

[1]  Frank Harary,et al.  Graph Theory , 2016 .

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

[3]  Thomas Erlebach,et al.  Wavelength conversion in networks of bounded treewidth , 2002 .

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

[5]  Toshihiro Fujito.  A Primal-Dual Approach to Approximation of Node-Deletion Problems for Matroidal Properties , 1997, ICALP.

[6]  B. Mukherjee,et al.  A Review of Routing and Wavelength Assignment Approaches for Wavelength- Routed Optical WDM Networks , 2000 .

[7]  Ioannis Caragiannis,et al.  Sparse and limited wavelength conversion in all-optical tree networks , 2001, Theor. Comput. Sci..

[8]  Mihalis Yannakakis,et al.  Optimization, approximation, and complexity classes , 1991, STOC '88.

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

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

[11]  Mihalis Yannakakis,et al.  Multiway Cuts in Directed and Node Weighted Graphs , 1994, ICALP.

[12]  Janos Simon,et al.  Decidable Properties of Graphs of All-Optical Networks , 2001, ICALP.

[13]  Carsten Lund,et al.  The Approximation of Maximum Subgraph Problems , 1993, ICALP.

[14]  Mihalis Yannakakis,et al.  Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications , 1996, SIAM J. Comput..

[15]  Thomas Erlebach,et al.  On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements , 2003, STACS.

[16]  Satish Rao,et al.  An approximate max-flow min-cut relation for undirected multicommodity flow, with applications , 1995, Comb..

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