Abstract
This paper addresses the wavelength assignment problem (WAP) in optical wavelength division multiplexed (WDM) telecommunication networks. We show that, even though WAP on optical ring topology belongs to NP-hard, WAP can be exactly solvable in practical size optical WDM rings for current and future traffic demand. To accomplish this, we convert WAP to the vertex coloring problem of the related graph and choose a special integer programming formulation for the vertex coloring problem. We develop a branch-and-price algorithm for the problem and carry out the performance comparison of the suggested algorithm with a well-known heuristics.
This work was supported by grant No.R01-2004-000-10948-0 from the Basic Research Program of the Korea Science & Engineering Foundation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Ramaswami, R., Sivarajan, K.N.: Optical Networks: A Practical Perspective. Morgan Kaufmann, San Francisco (1998)
Yuan, X., Fulay, A.: Wavelength assignment to minimize the number of SONET ADMs in WDM Rings. Photonic Network Communications 5(1), 59–68 (2003)
Wilfong, G., Winkler, P.: Ring routing in WDM networks. In: Proc. IEEE Infocom 1999 (1999)
Tucker, A.: Coloring a family of circular arcs. SIAM J. Applied Mathematics 29(3), 493–502 (1975)
Garey, M., Johnson, D.S.: The complexity of coloring circular arcs and chord. SIAM J. Algebraic Discrete Methods 1(2), 216–227 (1980)
Erlebach, T., Jansen, K.: The complexity of call-scheduling (1997) (preprint)
Ramaswami, R., Sivarajan, K.N.: Routing and wavelength assignment in all-optical networks. IEEE/ACM Trans. on Networking, 489–500 (October 1995)
Birge, J., Murty, K. (eds.): Mathematical Programming: State of the Art 1994, University of Michigan (1994)
Nemhauser, G., Wolsey, L.: Integeger and Combinatorial Optimization. Wiley, Chichester (1988)
Mehrotra, A., Trick, M.A.: A column generation approach for graph coloring (1995) (preprint)
Hsiao, J.Y., Tang, C.Y., Chang, R.S.: An efficient algorithms for finding a maximum weighted 2-independent set on interval graph. Information Processing Letters (43), 229–235 (1992)
Brélaz, D.: New methods to color the vertices of a graph. Communications of the ACM 22, 251–256 (1979)
Liu, L., Li, X., Wan, P., Frieder, O.: Wavelength assignment in WDM rings to minimize SONET ADMs. In: Proc. IEEE INFOCOM 2000, vol. 2, pp. 1020–1025 (2000)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, H., Kim, Y.B., Noh, S.J., Hur, S. (2005). Wavelength Assignment in Route-Fixed Optical WDM Ring by a Branch-and-Price Algorithm. In: Lorenz, P., Dini, P. (eds) Networking - ICN 2005. ICN 2005. Lecture Notes in Computer Science, vol 3420. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31956-6_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-31956-6_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25339-6
Online ISBN: 978-3-540-31956-6
eBook Packages: Computer ScienceComputer Science (R0)