Skip to main content
SpringerLink
Log in

A Fast Heuristic for Genetic Algorithms in Link Weight Optimization

  • Conference paper
Book cover Quality of Service in the Emerging Networking Panorama (WQoSR 2004, QofIS 2004, ICQT 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3266))

Abstract

Genetic algorithms are a useful tool for link weight optimization in intra-domain traffic engineering where the maximum link load is to be minimized. As a local heuristic, the weight of the maximum loaded link is increased to speed up the search for a near-optimal solution. We show that implementing this heuristic as directed mutation outperforms an implementation as an inner loop in both quality of the result and number of calls to the objective function when used together with caching. Optimal mutation rates result in surprisingly high cache hit ratios.

This work was partially funded by the Bundesministerium für Bildung und Forschung (ministry for education and research) of the Federal Republic of Germany under contract 01AK045. The authors alone are responsible for the content of the paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Moy, J.: OSPF version 2. RFC 2328 (1998)

    Google Scholar 

  2. Callon, R.: Use of OSI IS-IS for routing in TCP/IP and dual environments. RFC 1195 (1990)

    Google Scholar 

  3. Lorenz, D.H., Orda, A., Raz, D., Shavitt, Y.: How good can IP routing be? Technical Report DIMACS TR: 2001-17, Center for Discrete Mathematics and Theoretical Computer Science (2001)

    Google Scholar 

  4. Fortz, B., Thorup, M.: Increasing internet capacity using local search. Technical Report IS-MG 2000/21, Universit Libre de Bruxelles (2000)

    Google Scholar 

  5. Fortz, B., Thorup, M.: Internet traffic engineering by optimizing OSPF weights. In: INFOCOM, pp. 519–528 (2000)

    Google Scholar 

  6. Fortz, B., Thorup, M.: Optimizing OSPF/IS-IS weights in a changing world. IEEE J. Select. Areas Commun. 20, 756–767 (2002)

    Article  Google Scholar 

  7. Fortz, B., Rexford, J., Thorup, M.: Traffic engineering with traditional IP protocols. IEEE Commun. Mag. 40, 118–124 (2002)

    Article  Google Scholar 

  8. Nucci, A., Schroeder, B., Bhattacharyya, S., Taft, N., Diot, C.: IGP link weight assignment for transient link failures. In: ITC 18 (2003)

    Google Scholar 

  9. Buriol, L.S., Resende, M.G.C., Ribeiro, C.C., Thorup, M.: A memetic algorithm for OSPF routing. In: INFORMS, pp. 187–188 (2002)

    Google Scholar 

  10. Buriol, L.S., Resende, M.G.C., Ribeiro, C.C., Thorup, M.: A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing (2003)

    Google Scholar 

  11. Riedl, A.: A hybrid genetic algorithm for routing optimization in IP networks utilizing bandwidth and delay metrics. In: IEEE IPOM (2002)

    Google Scholar 

  12. Ericsson, M., Resende, M.G.C., Pardalos, P.M.: A genetic algorithm for the weight setting problem in OSPF routing. Technical report, ATT Shannon Laboratory (2001)

    Google Scholar 

  13. Mulyana, E., Killat, U.: An alternative genetic algorithm to optimize OSPF weights. In: 15-th ITC Specialist Seminar (2002)

    Google Scholar 

  14. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  15. Fortz, B., Thorup, M.: Robust optimization of OSPF/IS-IS weights. In: INOC, pp. 225–230 (2003)

    Google Scholar 

  16. Yuan, D.: A bi-criteria optimization approach for robust OSPF routing. In: IEEE IPOM (2003)

    Google Scholar 

  17. Riedl, A., Bauschert, T., Frings, J.: A framework for multi-service IP network planning. In: 10th International Telecommunication Network Strategy and Planning Symposium, Networks 2002 (2002)

    Google Scholar 

  18. Eigen, M.: Selforganization of matter and the evolution of biological macromolecules. Naturwissenschaften 58, 465–523 (1971)

    Article  Google Scholar 

  19. Nowak, M., Schuster, P.: Error thresholds of replication in finite populations mutation frequencies and the onset of muller’s ratchet. J. theor. Biol. 137, 375–395 (1989)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fraunhofer FOKUS, Kaiserin-Augusta-Allee 31, 10589, Berlin, Germany

    Christoph Reichert & Thomas Magedanz

Authors
  1. Christoph Reichert
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Thomas Magedanz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Architecture Dept., Jordi Girona, Technical University of Catalonia (UPC), 1-3 (Campus Nord D6), 08034, Barcelona, Spain

    Josep Solé-Pareta

  2. Fraunhofer Institut FOKUS, Kaiserin-Augusta Allee 31, 10589, Berlin, Germany

    Michael Smirnov

  3. Delft University of Technology,  

    Piet Van Mieghem

  4. Advanced Broadband Communications Centre, Technical University of Catalunya (UPC), Spain

    Jordi Domingo-Pascual

  5. University of Coimbra, CISUC/DEI, Coimbra, Portugal

    Edmundo Monteiro

  6. Telecommunications Research Center Vienna (ftw.), Donau-City-Str. 1, 1220, Vienna, Austria

    Peter Reichl

  7. Department of Informatics IFI, University of Zurich, Binzmühlestrasse 14, CH—8050, Zürich, Switzerland

    Burkhard Stiller

  8. Computer Laboratory, University of Cambridge, 15 JJ Thomson Avenue, CB 3 0FD, Cambridge, UK

    Richard J. Gibbens

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Reichert, C., Magedanz, T. (2004). A Fast Heuristic for Genetic Algorithms in Link Weight Optimization. In: Solé-Pareta, J., et al. Quality of Service in the Emerging Networking Panorama. WQoSR QofIS ICQT 2004 2004 2004. Lecture Notes in Computer Science, vol 3266. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30193-6_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30193-6_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23238-4

  • Online ISBN: 978-3-540-30193-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation