Abstract
The routing and wavelength assignment (RWA) problem is NP-hard and also an important issue in wavelength-division multiplexing (WDM) optical networks. We propose an algorithm which is based on the maximum number of edge-disjoint paths (MEDP) to solve the RWA problem. The performance of the proposed method has been verified by experiments on several realistic network topologies.
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
Martins, A.X., Duhamel, C., Mahey, P., Saldanha, R.R., de Souza, M.C.: Variable neighborhood descent with iterated local search for routing and wavelength assignment. Computers and Operations Research 39(9), 2133–2141 (2012)
Hsu, C.-C., Cho, H.-J.: A Genetic Algorithm for the Maximum Edge-disjoint Paths Problem. Accepted by Neurocomputing
Li, G., Shmha, R.: The partition coloring problem and its application to wavelength routing and assignment. In: Proceedings of the First Workshop on Optical Networks (2000)
Zang, H., Jue, J.P., Mukherjee, B.: A review of routing and wavelength assignment approaches for wavelength-routed optical WDM networks. Optical Networks Magazine 1, 47–60 (2000)
Chlamtac, I., Ganz, A., Karmi, G.: Lightpath communications: an approach to high bandwidth optical WAN’s. IEEE Transactions on Communications 40(7), 1171–1182 (1992)
Choi, J.S., Golmie, N., Lapeyrere, F., Mouveaux, F., Su, D.: A functional classification of routing and wavelength assignment schemes in DWDM networks: Static Case. In: Proceedings of the 7th International Conference on Optical Communications and Networks, pp. 1109–1115 (2000)
Skorin-Kapov, N.: Routing and wavelength assignment in optical networks using bin packing based algorithms. European Journal of Operational Research 177, 1167–1179 (2007)
Manohar, P., Manjunath, D., Shevgaonkar, R.K.: Routing and wavelength assignment in optical networks from edge disjoint path algorithms. IEEE Communications Letters 6(5), 211–213 (2002)
Noronha, T.F., Resende, M.G.C., Ribeiro, C.C.: A biased random-key genetic algorithm for routing and wavelength assignment. Journal of Global Optimization 50(3), 503–518 (2011)
Noraha, T.F., Ribeiro, C.C.: Routing and wavelength assignment by partition colouring. European Journal of Operational Research 171(3), 797–810 (2006)
Fischer, T., Bauer, K., Merz, P., Bauer, K.: Solving the routing and wavelength assignment problem with a multilevel distributed memetic algorithm. Memetic Computing 1(2), 101–123 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Hsu, CC., Cho, HJ., Fang, SC. (2014). Routing and Wavelength Assignment in Optical Networks from Maximum Edge-Disjoint Paths. In: Pan, JS., Krömer, P., Snášel, V. (eds) Genetic and Evolutionary Computing. Advances in Intelligent Systems and Computing, vol 238. Springer, Cham. https://doi.org/10.1007/978-3-319-01796-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-01796-9_10
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-01795-2
Online ISBN: 978-3-319-01796-9
eBook Packages: EngineeringEngineering (R0)