Abstract
We study a wavelength assignment maximization problem in multifiber WDM networks. Given a network G, a set of requests, the number of fibers per link and the number of wavelengths, we want to maximize the number of requests that can be satisfied simultaneously. We propose polynomial time algorithms, that are either optimal or have a guaranteed worst case performance in basic topologies, such as chain, ring and star networks.
Research supported in part by the Greek Ministry of Education through grants “Pythagoras” and “Protagoras”, of the EU funded program EPEAEK.
Chapter PDF
Similar content being viewed by others
References
Nomikos, C., Pagourtzis, A., Zachos, S.: Satisfying a maximum number of prerouted requests in all-optical rings. Computer Networks 42, 55–63 (2003)
Erlebach, T., Jansen, K.: Maximizing the number of connections in optical tree networks. In: Chwa, K.-Y., Ibarra, O.H. (eds.) ISAAC 1998. LNCS, vol. 1533, pp. 179–188. Springer, Heidelberg (1998)
Erlebach, T., Pagourtzis, A., Potika, K., Stefanakos, S.: Resource allocation problems in multifiber WDM tree networks. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 218–229. Springer, Heidelberg (2003)
Saad, M., Luo, Z.: On the routing and wavelength assignement in multifiber WDM networks. In: Proceedings of Globecom 2002 (2002)
Li, D., Jia, X., Hu, X., Gong, E.Z.: Wavelength assignment for minimizing system blockings in multifiber all-optical WDM networks. Optical Networks 4, 75–81 (2003)
Carlislie, M., Lloyd, E.: On the k-coloring of intervals. Discrete Applied Mathematics 59, 225–235 (1995)
Nomikos, C., Pagourtzis, A., Zachos, S.: Routing and path multicoloring. Information Processing Letters 80, 249–256 (2001)
Adamy, U., Ambuehl, C., Anand, R.S., Erlebach, T.: Call control in rings. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 788–799. Springer, Heidelberg (2002)
Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18, 3–20 (1997)
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
Potika, K. (2005). Maximizing the Number of Connections in Multifiber WDM Chain, Ring and Star Networks. In: Boutaba, R., Almeroth, K., Puigjaner, R., Shen, S., Black, J.P. (eds) NETWORKING 2005. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems. NETWORKING 2005. Lecture Notes in Computer Science, vol 3462. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11422778_139
Download citation
DOI: https://doi.org/10.1007/11422778_139
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25809-4
Online ISBN: 978-3-540-32017-3
eBook Packages: Computer ScienceComputer Science (R0)