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.
Similar content being viewed by others
References
The Library of Efficient Datatypes and Algorithms (LEDA). Algorithmic Solutions Software GmbH, Available from http://www.algorithmic-solutions.com
Fortz, B., Thorup, E.: Internet traffic engineering by optimizing OSPF weights. In: Proc. IEEE INFOCOM, pp. 519–528 (2000)
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)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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