Open AccessRouting in Networks using Genetic Algorithm
Author(s) -
Meenakshi Moza,
Suresh Kumar
Publication year - 2017
Publication title -
bulletin of electrical engineering and informatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.251
H-Index - 12
ISSN - 2302-9285
DOI - 10.11591/eei.v6i1.574
Subject(s) - computer science , equal cost multi path routing , shortest path problem , computer network , k shortest path routing , private network to network interface , genetic algorithm , constrained shortest path first , link state routing protocol , distributed computing , routing (electronic design automation) , static routing , path (computing) , selection (genetic algorithm) , mathematical optimization , routing protocol , artificial intelligence , machine learning , mathematics , theoretical computer science , graph
With the increase in traffic, internet service providers are trying their best to provide maximum utilization of resources available. The current traffic load has to be taken into account for computation of paths in routing protocols. Network applications; require the shortest paths to be used for communication purposes. Addressing the selection of path, from a known source to destination is the basic aim of this paper. This paper proposes a method of calculating the shortest path for a network using a combination of Open shortest path first and Genetic Algorithm (OSGA). Genetic Algorithm is used in this paper for optimization of routing. It helps in enhancing the performance of the routers.