2018
DOI: 10.1504/ijcnds.2018.091052
|View full text |Cite
|
Sign up to set email alerts
|

Routing in networks using genetic algorithm

Abstract: 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 combina… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 1 publication
0
2
0
Order By: Relevance
“…One of the greatest advantages of GAs is the simplicity in the optimization problem formulation [32]. Usually, fixed-length bit strings are used as input for the algorithm, which perfectly adapts to problems involving graphs [33][34][35]. Another advantage is the fast convergence time, in comparison to polynomial algorithms, for problems that involve a large number of variables [36].…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…One of the greatest advantages of GAs is the simplicity in the optimization problem formulation [32]. Usually, fixed-length bit strings are used as input for the algorithm, which perfectly adapts to problems involving graphs [33][34][35]. Another advantage is the fast convergence time, in comparison to polynomial algorithms, for problems that involve a large number of variables [36].…”
Section: Genetic Algorithmmentioning
confidence: 99%
“…From the previous researches, most researchers used genetic algorithm to optimise the system parameter such as routing in networks, job shop scheduling problem and isothermal liquid phase kinetic sequence [7]- [9]. Moreover, the Non-Dominated Sorting Genetic Algorithm II (NSGA-II) is proving to be a robust optimization algorithm for a wide range of multi-objective problems.…”
Section: Introductionmentioning
confidence: 99%