Skip to main content
SpringerLink
Log in
Book cover

Conference of the Canadian Society for Computational Studies of Intelligence

Canadian AI 2004: Advances in Artificial Intelligence pp 571–572Cite as

Genetic Algorithm Based OSPF Network Routing Using LEDA

  • Conference paper

  • 1508 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3060))

Abstract

As a predominant technique to estimate the cause and effect of Quality of Service (QoS) criteria in computer networks, simulations provide insight into how to most efficiently configure protocols to maximize the usage and to estimate the criteria for acceptable performance of network applications. This paper investigates the simulation of Genetic Algorithm-based network routing using Open Shortest Path First (OSPF) protocols. The simulator is implemented using LEDA (Library of Efficient Data types and Algorithms) [1] and the applicability of the library is examined in the context of Genetic Algorithms.

This is a preview of subscription content, 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

Learn about institutional subscriptions

References

  1. The Library of Efficient Datatypes and Algorithms (LEDA). Algorithmic Solutions Software GmbH, Available from http://www.algorithmic-solutions.com

  2. Fortz, B., Thorup, E.: Internet traffic engineering by optimizing OSPF weights. In: Proc. IEEE INFOCOM, pp. 519–528 (2000)

    Google Scholar 

  3. Coffman, K.G., Odlyzko, A.M.: Internet growth: Is there a ”Moore’s Law” for data traffic? In: Abello, J., Pardalos, P.M., Resende, M.G.C. (eds.), pp. 47–93. Kluwer Academic Publishers, Dordrecht (2001)

    Google Scholar 

  4. Ericsson, M., Resende, M.G.C., Pardalos, P.M.: A genetic algorithm for the weight setting problem in OSPF routing. Journal of Combinatorial Optimization 6(3), 299–333 (2002)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. InfoNet Media Center Simon Fraser University, Surrey, Canada, V3T 2W1

    Lenny Tang, Kay Wiese & Vive Kumar

Authors
  1. Lenny Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kay Wiese
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Vive Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Windsor, 401 Sunset Avenue, N9B 3P4, Windsor, Ontario, Canada

    Ahmed Y. Tawfik

  2. School of Computer Science, University of Windsor, Windsor, Ontario,  

    Scott D. Goodwin

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tang, L., Wiese, K., Kumar, V. (2004). Genetic Algorithm Based OSPF Network Routing Using LEDA. In: Tawfik, A.Y., Goodwin, S.D. (eds) Advances in Artificial Intelligence. Canadian AI 2004. Lecture Notes in Computer Science(), vol 3060. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24840-8_62

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24840-8_62

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22004-6

  • Online ISBN: 978-3-540-24840-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation