Genetic Algorithm Based OSPF Network Routing Using LEDA

  • Lenny Tang
  • Kay Wiese
  • Vive Kumar
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

References

  1. 1.
    The Library of Efficient Datatypes and Algorithms (LEDA). Algorithmic Solutions Software GmbH, Available from http://www.algorithmic-solutions.com
  2. 2.
    Fortz, B., Thorup, E.: Internet traffic engineering by optimizing OSPF weights. In: Proc. IEEE INFOCOM, pp. 519–528 (2000)Google Scholar
  3. 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. 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)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Lenny Tang
    • 1
  • Kay Wiese
    • 1
  • Vive Kumar
    • 1
  1. 1.InfoNet Media Center Simon Fraser UniversitySurreyCanada

Personalised recommendations