Algorithms for routing around a rectangle
Discrete Applied Mathematics - Special issue: graphs in electrical engineering, discrete algorithms and complexity
Ring routing and wavelength translation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Wavelength conversion in optical networks
Journal of Algorithms
Some APX-completeness results for cubic graphs
Theoretical Computer Science
Sparse and limited wavelength conversion in all-optical tree networks
Theoretical Computer Science
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
| Hi-index | 0.04 |
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.