Multi Population Pattern Searching Algorithm for Solving Routing Spectrum Allocation with Joint Unicast and Anycast Problem in Elastic Optical Networks

  • Michal PrzewozniczekEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9375)


Exponentially growing network traffic is triggered by different services including cloud computing, Content Delivery Networks and other. To satisfy these needs, new network technologies like Elastic Optical Networks (EON) are proposed. The EONs bring new, hard optimization problems, like Routing and Spectrum Allocation problem considered in this paper. The well-known and common tools to solve the NP-hard problems are Evolutionary Algorithms (EA). A number of EA-based methods were proposed to solve the RSA problem. However, the papers concerning the RSA problem omit the relatively new propositions of linkage learning methods. Therefore this paper proposes a new effective method that includes linkage learning, local optimization and is based on a novel, effective work schema to fill this gap.


Linkage learning MuPPetS Local optimization Hybrid methods Elastic optical networks Routing and spectrum allocation 



The author of this work would like to express his sincere appreciation to his advisor professor Krzysztof Walkowiak for his valuable suggestions during the paper redaction process.

This work was supported in by the Polish National Science Centre (NCN) under Grant DEC-2012/07/B/ST7/01215 and by the European Commission under the 7th Framework Programme, Coordination and Support Action, Grant Agreement Number 316097, ENGINE – European research centre of Network intelliGence for INnovation Enhancement.


  1. 1.
    Aibin, M., Walkowiak, K.: Simulated Annealing algorithm for optimization of elastic optical networks with unicast and anycast traffic. In: Proceedings of 16th International Conference on Transparent Optical Networks ICTON (2014)Google Scholar
  2. 2.
    Cerutti, I., Martinelli, F., Sambo, N., Cugini, F., Castoldi, P.: Trading regeneration and spectrum utilization in code-rate adaptive flexi-grid networks. J. Lightwave Technol. 32(23), 4496–4503 (2014)CrossRefGoogle Scholar
  3. 3.
    Chen, Y., Sastry, K., Goldberg, D.E.: A Survey of Linkage Learning Techniques in Genetic and Evolutionary Algorithms. In: IlliGAL Report No. 2007014, Illinois Genetic Algorithms Laboratory (2007)Google Scholar
  4. 4.
    Christodoulopoulos, K., Tomkos, I., Varvarigos, E.A.: Elastic bandwidth allocation in flexible OFDM based optical networks. IEEE J. Lightwave Technol. 29(9), 1354–1366 (2011)CrossRefGoogle Scholar
  5. 5.
    Eira, A., Santos, J., Pedro, J., Pires, J.: Multi-objective design of survivable flexible-grid DWDM networks. IEEE/OSA J. Opt. Commun. Netw. 6(3), 326–339 (2014)CrossRefGoogle Scholar
  6. 6.
    Goldberg, D.E., et. al.: Rapid, accurate optimization of difficult problems using fast messy genetic algorithms. In: Proceedings of 5th International Conference on Genetic Algorithms (1993)Google Scholar
  7. 7.
    Goscien, R., Walkowiak, K., Klinkowski, M.: Tabu search algorithm for routing, modulation and spectrum allocation in elastic optical network with anycast and unicast traffic. Comput. Netw. 79, 148–165 (2015)CrossRefGoogle Scholar
  8. 8.
    Huang, T., Li, B.: A genetic algorithm using priority-based encoding for routing and spectrum assignment in elastic optical networks. In: Proceedings of ICICTA (2014)Google Scholar
  9. 9.
    ILOG AMPL/CPLEX software. ILOG website:
  10. 10.
    Jinno, M., et al.: Distance-adaptive spectrum resource allocation in spectrum sliced elastic optical path network. IEEE Commun. Mag. 48(8), 138–145 (2010)CrossRefGoogle Scholar
  11. 11.
    Kwasnicka, H., Przewozniczek, M.: Multi population pattern searching algorithm: a new evolutionary method based on the idea of messy genetic algorithm. IEEE Trans. Evol. Comput. 15(5), 715–734 (2011)CrossRefGoogle Scholar
  12. 12.
    Long, G., Xiang, Z., Wei, L., Zuqing, Z.: A two-population based evolutionary approach for optimizing routing, modulation and spectrum assignment (RMSA) in O-OFDM networks. IEEE Commun. Lett. 16(9), 1520–1523 (2012)CrossRefGoogle Scholar
  13. 13.
    Orlowski, S., Wessaly, R., Pioro, M., Tomaszewski, A.: SNDlib 1.0—survivable network design library. Networks 55(3), 276–286 (2010)Google Scholar
  14. 14.
    Patel, A.N., Ji, P.N., Jue, J.P., Ting, W.: A naturally-inspired algorithm for routing, wavelength assignment, and spectrum allocation in flexible grid WDM networks. In: Proceedings of IEEE GC Workshops (2012)Google Scholar
  15. 15.
    Velasco, L., Wright, P., Lord, A., Junyent, G.: Saving CAPEX by extending flexgrid-based core optical networks toward the edges. IEEE/OSA J. Opt. Commun. Netw. 5(10), A171–A183 (2013)CrossRefGoogle Scholar
  16. 16.
    Walkowiak, K., Klinkowski, M.: Joint anycast and unicast routing for elastic Optical networks: modeling and optimization. In: Proceedings of IEEE ICC (2013)Google Scholar
  17. 17.
    Walkowiak, K., Przewozniczek, M., Pajak, K.: Heuristic algorithms for survivable P2P multicasting. Appl. Artif. Intell. 27(4), 278–303 (2013)CrossRefGoogle Scholar
  18. 18.
    Walkowiak, K., Klinkowski, M., Rabiega, B., Goscien, R.: Routing and spectrum allocation algorithms for elastic optical networks with dedicated path protection. Opt. Switching Netw. 13, 63–75 (2014). doi: 10.1016/j.osn.2014.02.002 CrossRefGoogle Scholar
  19. 19.
    Xiang, Z., Wei, L., Long, G., Zuqing, Z.: Dynamic RMSA in elastic optical networks with an adaptive genetic algorithm. In: Proceedings of IEEE GLOBECOM (2012)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Department of Computational IntelligenceWroclaw University of TechnologyWroclawPoland

Personalised recommendations