Abstract
Wavelengths are limited resource in WDM networks. State-of-the-art technology allows close to 300 wavelengths in the laboratory. However, less than 64 wavelengths can be used in real systems. Thus how to make wavelength assignment is crucial for taking full advantage of the potential of WDM networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. Berge, The Theory of Graphs and its Applications, John Wiley, 1962.
T. Erlebach and K. Jansen, Scheduling of virtual connections in fast networks, Proceedings of the 4th Workshop on Parallel Systems and Algorithms (PASA), 1996, 13–32.
T. Erlebach, K. Jansen, C. Kaklamanis, and P. Persiano, An optimal greedy algorithm in directed tree networks, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 40 (1998), 117–129.
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 Discrete Methods, 1 (2) (1980), 216–227.
I. Holyer, The NP-completeness of edge-coloring, SIAM Journal on Computing, 10 (4) (1981), 718–720.
V. Kumar, An approximation algorithm for circular arc coloring, Algorithmica, 30 (2001), 406–417.
V. Kumar, Approximating circular arc coloring and bandwidth allocation in all-optical ring networks, Lecture Notes in Computer Science, 1444 (1998), 147–158.
V. Kumar and E. J. Schwabe, Improved access to optical bandwidth in trees, Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1997, 437–444.
G.-Z. Li and R. Sinha, On the wavelength assignment problem in multifiber WDM star and ring networks, IEEE/ACM Transactions on Networking, 9 (1) (2001), 60–68.
C. Lund and M. Yannakakis, On the hardness of approximating minimization problems, Journal of the ACM, 41 (5) (1994), 960–981.
D. W. Matula, G. Marble, and J. D. Isaacson, Graph coloring algorithms, in Graph Theory and Computing, R. C. Read, Ed., New York and London: Academic, 1972, 109–122.
A. Mokhtar and M. Azizoglu, Adaptive wavelength routing in all-optical networks, IEEE/ACM Transactions on Networking, 6 (2) (1998), 197–206.
T. Nishizeki and K. Kashiwagi, On the 1.1 edge-coloring of multigraphs, SIAM Journal on Discrete Mathematics, 3 (3) (1990), 391–410.
P. Raghavan and E. Upfal, Efficient routing in all-optical networks, Proceedings of the 26th Annual ACM Symposium Theory of Computing (STOC), 1994, 134–143.
M. Slusarek, A coloring algorithm for interval graphs, Lecture Notes in Computer Science, 379 (1989), 471–480.
G. Wilfong and P. Winkler, Ring routing and wavelength translation, Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 1998, 333–341.
M. Yannakakis and F. Gavril, Edge dominating sets in graphs, SIAM Journal on Applied Mathematics, 38 (1980), 364–372.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Jia, X., Hu, XD., Du, DZ. (2002). Wavelength Assignment. In: Multiwavelength Optical Networks. Network Theory and Applications, vol 9. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-3563-5_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3563-5_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5226-4
Online ISBN: 978-1-4757-3563-5
eBook Packages: Springer Book Archive