Abstract
This study considers the routingand wavelength assignment problem (RWA) in optical wavelength-division-multiplexed networks. The focus is dynamic traffic, in which the number of wavelengths per fiber is fixed. We minimize connection blocking usingan ant-colony- optimization (ACO) algorithm that quantifies the importance of combining path-leng th and congestion information in making routing decisions to minimize total network connection blocking. The ACO algorithm achieves lower blockingrates than an exhaustive search over all available wavelengths for the shortest path.
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
Hui, Z., Jue, J., and Mukherjee, B. “A Review of Routingand Wavelength Assignment Approaches for Wavelength-Routed Optical WDM Networks,” Optical Networks, January 2000.
Zhang, X. and Qiao, C. “Wavelength Assignment for Dynamic Traffic in Multi-fiber WDM Networks,” ICCCN’98, pp. 479–585, 1998.
Stern, T.E. and Bala, K., “Multiwavelength Optical Networks.” Addison-Wesley, 1999.
Navarro-Varela, G. and Sinclair, M. “Ant-Colony Optimisation for Virtual-Wavelength-Path Routing and Wavelength Allocation,” Proc. Congress on Evolutionary Computation (CEC’99), Washington DC, USA, July 1999, pp. 1809–1816.
Li, L. and Somani, A., “Dynamic Wavelength RoutingUsingCong estion and Neighborhood Information.” IEEE Trans. Networking, Vol 7, No. 5, Oct. 1999.
Glover, F., Laguna M., and Laguna F., Tabu Search. Kluwer Academic Publishers, 1997.
Mokhtar, A. and Azizoglu, M. “Adaptive Wavelength Routing in All-Optical Networks,” IEEE/ACM Transactions on Networking, Vol. 6, No. 2, April 1998.
Chan, K. and Yum, T.P., “Analysis of least congested path routing in WDM lightwave networks.” INFOCOM’94. Networkingfor Global Communications, 13th Proceedings IEEE, 1994. pp. 962–969.
Banerjee, D. and Mukherjee, B. “A Practical Approach for Routingand Wavelength Assignment in Large Wavelength-Routed Optical Networks.” IEEE Journal on Selec. Areas in Comm., vol 14, No. 5, June 1996.
Colorni, A., Dorigo, M. & Maniezzo, V. “Distributed optimization by ant colonies,” Proc. First European Conference on Artificial Life, Paris, France, pp. 134–142, 1991.
Dorigo, M. and Gambardella, L.M., “Ant-Colony System: A Cooperative Learning Approach to the Travelling Salesman Problem.” IEEE Transactions on Evolutionary Computation, pp. 53–66.
Karasan, E. and Ayanoglu E., “Effects of Wavelength Routing and Selection Algorithms on Wavelength Conversion Gain in WDM Optical Networks.” IEEE Trans. Networking, vol 6, pp. 186–196, April 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garlick, R.M., Barr, R.S. (2002). Dynamic Wavelength Routing in WDM Networks via Ant Colony Optimization. In: Dorigo, M., Di Caro, G., Sampels, M. (eds) Ant Algorithms. ANTS 2002. Lecture Notes in Computer Science, vol 2463. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45724-0_23
Download citation
DOI: https://doi.org/10.1007/3-540-45724-0_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44146-5
Online ISBN: 978-3-540-45724-4
eBook Packages: Springer Book Archive