Skip to main content
Book cover

International Conference on Evolutionary Multi-Criterion Optimization

EMO 2015: Evolutionary Multi-Criterion Optimization pp 573–587Cite as

Comparison of Single and Multi-objective Evolutionary Algorithms for Robust Link-State Routing

Part of the Lecture Notes in Computer Science book series (LNTCS,volume 9019)

Abstract

Traffic Engineering (TE) approaches are increasingly important in network management to allow an optimized configuration and resource allocation. In link-state routing, the task of setting appropriate weights to the links is both an important and a challenging optimization task. A number of different approaches has been put forward towards this aim, including the successful use of Evolutionary Algorithms (EAs). In this context, this work addresses the evaluation of three distinct EAs, a single and two multi-objective EAs, in two tasks related to weight setting optimization towards optimal intra-domain routing, knowing the network topology and aggregated traffic demands and seeking to minimize network congestion. In both tasks, the optimization considers scenarios where there is a dynamic alteration in the state of the system, in the first considering changes in the traffic demand matrices and in the latter considering the possibility of link failures. The methods will, thus, need to simultaneously optimize for both conditions, the normal and the altered one, following a preventive TE approach towards robust configurations. Since this can be formulated as a bi-objective function, the use of multi-objective EAs, such as SPEA2 and NSGA-II, came naturally, being those compared to a single-objective EA. The results show a remarkable behavior of NSGA-II in all proposed tasks scaling well for harder instances, and thus presenting itself as the most promising option for TE in these scenarios.

Keywords

  • Multi-objective evolutionary algorithms
  • Traffic engineering
  • NSGA
  • SPEA
  • Intra-domain routing
  • OSPF

This is a preview of subscription content, access via your institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/978-3-319-15892-1_39
  • Chapter length: 15 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   84.99
Price excludes VAT (USA)
  • ISBN: 978-3-319-15892-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   109.99
Price excludes VAT (USA)
Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Altin, A., Fortz, B., Thorup, M., Ümit, H.: Intra-domain traffic engineering with shortest path routing protocols. Annals of Operations Research 204(1), 56–95 (2013)

    CrossRef  Google Scholar 

  2. Awduche, D., Malcolm, J., Agogbua, J., O’Dell, M., McManus, J.: Requirements for Traffic Engineering Over MPLS. RFC 2702 (Informational), September 1999

    Google Scholar 

  3. Claise, B.: RFC 3954 - Cisco Systems NetFlow Services Export Version 9, October 2004

    Google Scholar 

  4. Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evolutionary Computation 6(2), 182–197 (2002)

    CrossRef  Google Scholar 

  5. Dijkstra, E.: A note on two problems in connexion with graphs. Numerische Mathematik 1(1), 269–271 (1959)

    CrossRef  MATH  MathSciNet  Google Scholar 

  6. Evangelista, P., Maia, P., Rocha, M.: Implementing metaheuristic optimization algorithms with jecoli. In: Proceedings of the 2009 Ninth International Conference on Intelligent Systems Design and Applications, ISDA ’09, pp. 505–510. IEEE Computer Society, Washington, DC, USA (2009)

    Google Scholar 

  7. Fortz, B.: Internet traffic engineering by optimizing ospf weights. In: Proceedings of IEEE INFOCOM, pp. 519–528 (2000)

    Google Scholar 

  8. Fortz, B., Thorup, M.: Optimizing ospf/is-is weights in a changing world. IEEE Journal on Selected Areas in Communications 20(4), 756–767 (2002)

    CrossRef  Google Scholar 

  9. Iannaccone, G., Chuah, C., Mortier, R., Bhattacharyya, S., Diot, C.: Analysis of link failures in an ip backbone. In: Proceedings of the 2Nd ACM SIGCOMM Workshop on Internet Measurment, IMW ’02, pp. 237–242. ACM, New York, NY, USA (2002)

    Google Scholar 

  10. Medina, A., Lakhina, A., Matta, I., Byers, J.: Brite: Universal topology generation from a users perspective. Technical report, Boston, MA, USA (2001)

    Google Scholar 

  11. Moy, J.: OSPF Version 2. RFC 2328 (Standard), April 1998. Updated by RFC 5709

    Google Scholar 

  12. Oran, D.: OSI IS-IS Intra-domain Routing Protocol. Technical report, IETF, February 1990

    Google Scholar 

  13. Pereira, Vitor, Rocha, Miguel, Cortez, Paulo, Rio, Miguel, Sousa, Pedro: A Framework for Robust Traffic Engineering Using Evolutionary Computation. In: Doyen, Guillaume, Waldburger, Martin, Čeleda, Pavel, Sperotto, Anna, Stiller, Burkhard (eds.) AIMS 2013. LNCS, vol. 7943, pp. 1–12. Springer, Heidelberg (2013)

    CrossRef  Google Scholar 

  14. Rocha, M., Sousa, P., Cortez, P., Rio, M.: Quality of Service Constrained Routing Optimization Using Evolutionary Computation. Applied Soft Computing 11(1), 356–364 (2011)

    CrossRef  Google Scholar 

  15. Tan, K.C., Lee, T.H., Khor, E.F.: Evolutionary algorithms for multi-objective optimization: Performance assessments and comparisons. Artif. Intell. Rev. 17(4), pp. 251–290, June 2002

    Google Scholar 

  16. Zitzler, E., Laumanns, M., Thiele, L.: Spea 2: Improving the strength pareto evolutionary algorithm. Technical report (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Centro Algoritmi/Department of Informatics, University of Minho, Braga, Portugal

    Vitor Pereira & Pedro Sousa

  2. Centro Algoritmi/Department of Information Systems, University of Minho, Braga, Portugal

    Paulo Cortez

  3. Department of Electronic and Electrical Engineering, University College London, London, UK

    Miguel Rio

  4. Centre Biological Engineering/Department of Informatics, University of Minho, Braga, Portugal

    Miguel Rocha

Authors
  1. Vitor Pereira
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pedro Sousa
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Paulo Cortez
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Miguel Rio
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Miguel Rocha
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Miguel Rocha .

Editor information

Editors and Affiliations

  1. Institute for Polymers and Composites/I3N University of Minho Guimarães Portugal, Guimaraes, Portugal

    António Gaspar-Cunha

  2. Dept. of Electrical and Computer Engg, University of Coimbra, Coimbra, Portugal

    Carlos Henggeler Antunes

  3. CINVESTAV-IPN Depto. de Computacíon, Col. San Pedro Zacatenco, México DF, Mexico

    Carlos Coello Coello

Rights and permissions

Reprints and Permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Pereira, V., Sousa, P., Cortez, P., Rio, M., Rocha, M. (2015). Comparison of Single and Multi-objective Evolutionary Algorithms for Robust Link-State Routing. In: Gaspar-Cunha, A., Henggeler Antunes, C., Coello, C. (eds) Evolutionary Multi-Criterion Optimization. EMO 2015. Lecture Notes in Computer Science(), vol 9019. Springer, Cham. https://doi.org/10.1007/978-3-319-15892-1_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-15892-1_39

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-15891-4

  • Online ISBN: 978-3-319-15892-1

  • eBook Packages: Computer ScienceComputer Science (R0)