Optimal wavelength routing on directed fiber trees
Theoretical Computer Science
Ring routing and wavelength translation
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Wavelength conversion in optical networks
Journal of Algorithms
The complexity of path coloring and call scheduling
Theoretical Computer Science
Sparse and limited wavelength conversion in all-optical tree networks
Theoretical Computer Science
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks
APPROX '98 Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Routing to reduce the cost of wavelength conversion
Discrete Applied Mathematics
Minimizing maximum fiber requirement in optical networks
Journal of Computer and System Sciences
| Hi-index | 0.01 |
In all-optical networks with wavelength-division multiplexing, every connection is routed along a certain path and assigned a wavelength such that no two connections use the same wavelength on the same link. For a given set P of paths (a routing), let 驴(P) denote the minimum number of wavelengths in a valid wavelength assignment and let L(P) denote the maximum link load. We always have L(P) 驴 驴(P). Motivated by practical concerns, we consider routings containing only shortest paths. We give a complete characterization of undirected networks for which any set P of shortest paths admits a wavelength assignment with L(P) wavelengths. These are exactly the networks that do not benefit from the use of (expensive) wavelength converters if shortest-path routing is used. We also give an efficient algorithm for computing awavelength assignment with L(P) wavelengths in these networks.