Abstract
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.
Research partially supported by the Swiss National Science Foundation under Contract No. 21- 63563.00 (Project AAPCN) and the EU Thematic Network APPOL II (IST-2001-32007), with funding provided by the Swiss Federal Office for Education and Science (BBW).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
V. Auletta, I. Caragiannis, L. Gargano, C. Kaklamanis, and P. Persiano. Sparse and limited wavelength conversion in all-optical tree networks. Theoretical Computer Science, 266(1–2):887–934, 2001.
T. Erlebach and K. Jansen. The complexity of path coloring and call scheduling. Theoretical Computer Science, 255(1–2):33–50, 2001.
T. Erlebach, K. Jansen, C. Kaklamanis, M. Mihail, and P. Persiano. Optimal wavelength routing in directed fiber trees. Theoretical Computer Science, 221:119–137, 1999.
T. Erlebach and S. Stefanakos. On shortest-path all-optical networks without wavelength conversion requirements. TIK-Report 153, ETH Zurich, October 2002. Available electronically at ftp://ftp.tik.ee.ethz.ch/pub/publications/TIK-Report153.pdf.
T. Erlebach and S. Stefanakos. Wavelength conversion in networks of bounded treewidth. TIK-Report 132, ETH Zurich, April 2002. Available electronically at ftp://ftp.tik.ee.ethz.ch/pub/publications/TIK-Report132.pdf.
M. R. Garey, D. S. Johnson, G. L. Miller, and C. H. Papadimitriou. The complexity of coloring circular arcs and chords. SIAM Journal on Algebraic and Discrete Methods, 1(2):216–227, 1980.
J. M. Kleinberg and A. Kumar. Wavelength conversion in optical networks. Journal of Algorithms, 38(1):25–50, 2001.
D. König. Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre. Math. Ann., 77:453–465, 1916.
V. Kumar. Approximating circular arc colouring and bandwidth allocation in all-optical ring networks. In Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX’ 98), volume 1444 of Lecture Notes in Computer Science, pages 147–158, 1998.
Y. Rabani. Path coloring on the mesh. In Proceedings of the 37th Annual Symposium on Foundations of Computer Science (FOCS’96), pages 400–409, 1996.
G. T. Wilfong and P. Winkler. Ring routing and wavelength translation. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’98), pages 333–341, 1998.
H. Zang, J. P. Jue, and B. Mukherjee. A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks. Optical Networks Magazine, 1(1):47–60, January 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Erlebach, T., Stefanakos, S. (2003). On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements. In: Alt, H., Habib, M. (eds) STACS 2003. STACS 2003. Lecture Notes in Computer Science, vol 2607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36494-3_13
Download citation
DOI: https://doi.org/10.1007/3-540-36494-3_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00623-7
Online ISBN: 978-3-540-36494-8
eBook Packages: Springer Book Archive