Routing to reduce the cost of wavelength conversion

We consider all-optical networks that use wavelength-division multiplexing and employ wavelength conversion at specific nodes in order to maximize their capacity usage. We investigate the effect of allowing reroutings on the number of necessary wavelength converters. We disprove a claim of Wilfong and Winkler [G. Wilfong, P. Winkler, Ring routing and wavelength translation, in: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '98, 1998, pp. 333-341] according to which reroutings do not have any effect on the number of necessary wavelength converters on bidirected networks. We show that there exist (bidirected) networks on n nodes that require @Q(n) converters without reroutings, but only O(1) converters if reroutings are allowed. We also address the cases of undirected networks and networks with shortest-path routings. In each case, we resolve the complexity of computing optimal placements of converters.

[1]  M. Golumbic.  Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57) , 2004 .

[2]  Marek Karpinski,et al.  On Some Tighter Inapproximability Results (Extended Abstract) , 1999, ICALP.

[3]  Viggo Kann,et al.  Some APX-completeness results for cubic graphs , 2000, Theor. Comput. Sci..

[4]  Thomas Erlebach,et al.  Wavelength Conversion in Shortest-Path All-Optical Networks , 2003, ISAAC.

[5]  Giorgio Gambosi,et al.  Complexity and Approximation , 1999, Springer Berlin Heidelberg.

[6]  Giorgio Gambosi,et al.  Complexity and approximation: combinatorial optimization problems and their approximability properties , 1999 .

[7]  Thomas Erlebach,et al.  On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements , 2003, Symposium on Theoretical Aspects of Computer Science.

[8]  Thomas Erlebach,et al.  Wavelength Conversion in All-Optical Networks with Shortest-Path Routing , 2005, Algorithmica.

[9]  David S. Johnson,et al.  The Rectilinear Steiner Tree Problem is NP Complete , 1977, SIAM Journal of Applied Mathematics.

[10]  Nobuji Saito,et al.  Algorithms for Routing around a Rectangle , 1992, Discret. Appl. Math..

[11]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[12]  S. Safra,et al.  On the hardness of approximating minimum vertex cover , 2005 .

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

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

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

[16]  Mihalis Yannakakis,et al.  Optimization, Approximation, and Complexity Classes (Extended Abstract) , 1988, STOC 1988.

[17]  R. Steele.  Optimization , 2005 .

[18]  Stamatios Stefanakos,et al.  On the Design and Operation of High-Performance Optical Networks , 2004 .

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

[20]  P. Berman,et al.  On Some Tighter Inapproximability Results , 1998, Electron. Colloquium Comput. Complex..