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
The shortest path problem has many different versions. In this manuscript, we proposed a muti-constr...
Genetic algorithm and TSP are methods that can be solve optimization problem of route or path. Thi...
ABSTRAKSI: Jaringan telekomunikasi dikembangkan untuk menciptakan informasi dan mendistribusikannya ...
With the increase in traffic, internet service providers are trying their best to provide maximum ut...
Though shortest path routing algorithm such as OSPFs Dijkstra algorithm is well established, finding...
Providers (ISPs) try to meet the increasing traffic demand with new technology and improved utilizat...
Abstract: Routing Algorithm is that part of the network layer that is responsible for deciding the p...
The network field has been very popular in recent times and has aroused much of the attention of res...
This paper presents an approach to the shortest path routing problem that uses one of the most popul...
The shortest path problem has many different versions. In this manuscript, we proposed a muti-constr...
Shortest path routing is generally known as a kind of routing widely availed in computer networks no...
Internet protocol (IP) traffic follows rules established by routing pro-tocols, such as Open Shortes...
Restricted access due to publisher's copyright restrictions. The full text of this item cannot be cu...
The shortest path routing problem is a multiobjective nonlinear optimization problem with constraint...
Most of the multimedia applications require the k shortest paths during the communication between a ...
The shortest path problem has many different versions. In this manuscript, we proposed a muti-constr...
Genetic algorithm and TSP are methods that can be solve optimization problem of route or path. Thi...
ABSTRAKSI: Jaringan telekomunikasi dikembangkan untuk menciptakan informasi dan mendistribusikannya ...
With the increase in traffic, internet service providers are trying their best to provide maximum ut...
Though shortest path routing algorithm such as OSPFs Dijkstra algorithm is well established, finding...
Providers (ISPs) try to meet the increasing traffic demand with new technology and improved utilizat...
Abstract: Routing Algorithm is that part of the network layer that is responsible for deciding the p...
The network field has been very popular in recent times and has aroused much of the attention of res...
This paper presents an approach to the shortest path routing problem that uses one of the most popul...
The shortest path problem has many different versions. In this manuscript, we proposed a muti-constr...
Shortest path routing is generally known as a kind of routing widely availed in computer networks no...
Internet protocol (IP) traffic follows rules established by routing pro-tocols, such as Open Shortes...
Restricted access due to publisher's copyright restrictions. The full text of this item cannot be cu...
The shortest path routing problem is a multiobjective nonlinear optimization problem with constraint...
Most of the multimedia applications require the k shortest paths during the communication between a ...
The shortest path problem has many different versions. In this manuscript, we proposed a muti-constr...
Genetic algorithm and TSP are methods that can be solve optimization problem of route or path. Thi...
ABSTRAKSI: Jaringan telekomunikasi dikembangkan untuk menciptakan informasi dan mendistribusikannya ...