Skip to main content

Advertisement

SpringerLink
Log in
Menu
Find a journal Publish with us
Search
Cart
Book cover

Meeting of the European Network of Universities and Companies in Information and Communication Engineering

EUNICE 2012: Information and Communication Technologies pp 112–123Cite as

  1. Home
  2. Information and Communication Technologies
  3. Conference paper
Network Migration Optimization Using Genetic Algorithms

Network Migration Optimization Using Genetic Algorithms

  • Stefan Türk17,
  • Ying Liu17,
  • Rico Radeke17 &
  • …
  • Ralf Lehnert17 
  • Conference paper
  • 1345 Accesses

  • 3 Citations

Part of the Lecture Notes in Computer Science book series (LNISA,volume 7479)

Abstract

This paper introduces the problem of communication network migration for backbone networks. Heuristic solutions for this problem can be determined by the application of genetic algorithms to the problem. A description of the system model is presented, as well as the used algorithmic approaches and optimization results. Our main goal is the optimization of migration costs, by respecting increasing demands over the migration period, while device costs per bit are decreasing. We will present Crowded DPGA as best found GA to solve the network migration problem.

Keywords

  • Genetic Algorithm
  • Backbone Network
  • Migration Cost
  • Replacement Rule
  • Network Migration

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Download conference paper PDF

References

  1. Cisco, Cisco visual networking index: Forecast and methology, 2008-2013, Tech. Rep. (2009)

    Google Scholar 

  2. Michaelis, T., Duelli, M., Chamania, M., Lichtinger, B., Rambach, F., Türk, S.: Network planning, control and management perspectives on dynamic networking. In: 35th European Conference on Optical Communication, Vienna, Austria, p. 7.7.2 (2009)

    Google Scholar 

  3. Türk, S., Radeke, R., Lehnert, R.: Network migration using ant colony optimization. In: 9th Conference of Telecommunication, Media and Internet Techno-Economics, CTTE (June 2010)

    Google Scholar 

  4. Türk, S., Radeke, R.: Optimization of Energy Efficient Network Migration Using Harmony Search. In: Lehnert, R. (ed.) EUNICE 2011. LNCS, vol. 6955, pp. 89–99. Springer, Heidelberg (2011)

    CrossRef  Google Scholar 

  5. Ciena: The value of otn for network convergence and ip/ethernet migration (2009), http://www.ciena.com/files/

  6. Sivanandam, S., Deepa, S.: Introduction to genetic algorithms. Springer (2007)

    Google Scholar 

  7. Popov, A.: Genetic algorithms for optimization. User Manual, Hamburg (2005)

    Google Scholar 

  8. Türk, S., Sulaiman, S., Haidine, A., Lehnert, R., Michaelis, T.: Approaches for the migration of optical backbone networks towards carrier ethernet. In: 3rd IEEE Workshop on Enabling the Future Service-Oriented Internet - Towards Socially-Aware Networks, Honolulu, Hawaii, USA (2009)

    Google Scholar 

  9. Verbrugge, S.: Strategic planning of optical telecommunication networks in a dynamic and uncertain environment. Ph.D. dissertation. University of Ghent (2007)

    Google Scholar 

  10. Horn, J.: The nature of niching: Genetic algorithms and the evolution of optimal, cooperative populations. Ph.D. dissertation. Citeseer (1997)

    Google Scholar 

  11. Yuan, B.: Deterministic crowding, recombination and self-similarity. In: Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002, vol. 2, pp. 1516–1521. IEEE (2002)

    Google Scholar 

  12. Mengshoel, O., Galan, S.: Generalized crowding for genetic algorithms. In: Genetic and Evolutionary Computation Conference 2010 (GECCO 2010), pp. 775–782 (2010)

    Google Scholar 

  13. Park, T., Ryu, K.: A dual-population genetic algorithm for adaptive diversity control. IEEE Transactions on Evolutionary Computation 14(6), 865–884 (2010)

    CrossRef  Google Scholar 

  14. Park, T., Choe, R., Ryu, K.: Adjusting population distance for the dual-population genetic algorithm. In: Proceedings of the 20th Australian Joint Conference on Advances in Artificial Intelligence, pp. 171–180. Springer (2007)

    Google Scholar 

  15. Liu, Y.: Network migration optimization using genetic algorithms. Diploma thesis. Technische Universität Dresden (2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chair for Telecommunications, Technical University Dresden, Mommsenstr. 13, 01062, Dresden, Germany

    Stefan Türk, Ying Liu, Rico Radeke & Ralf Lehnert

Authors
  1. Stefan Türk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ying Liu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rico Radeke
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Ralf Lehnert
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Telecommunications and Media Informatics, Budapest University of Technology and Economics, Magyar Tudósok krt.2, 1117, Budapest, Hungary

    Róbert Szabó & Attila Vidács & 

Rights and permissions

Reprints and Permissions

Copyright information

© 2012 IFIP International Federation for Information Processing

About this paper

Cite this paper

Türk, S., Liu, Y., Radeke, R., Lehnert, R. (2012). Network Migration Optimization Using Genetic Algorithms. In: Szabó, R., Vidács, A. (eds) Information and Communication Technologies. EUNICE 2012. Lecture Notes in Computer Science, vol 7479. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32808-4_11

Download citation

  • .RIS
  • .ENW
  • .BIB
  • DOI: https://doi.org/10.1007/978-3-642-32808-4_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32807-7

  • Online ISBN: 978-3-642-32808-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Share this paper

Anyone you share the following link with will be able to read this content:

Sorry, a shareable link is not currently available for this article.

Provided by the Springer Nature SharedIt content-sharing initiative

Search

Navigation

  • Find a journal
  • Publish with us

Discover content

  • Journals A-Z
  • Books A-Z

Publish with us

  • Publish your research
  • Open access publishing

Products and services

  • Our products
  • Librarians
  • Societies
  • Partners and advertisers

Our imprints

  • Springer
  • Nature Portfolio
  • BMC
  • Palgrave Macmillan
  • Apress
  • Your US state privacy rights
  • Accessibility statement
  • Terms and conditions
  • Privacy policy
  • Help and support

167.114.118.210

Not affiliated

Springer Nature

© 2023 Springer Nature