An Efficient Approach towards Network Routing using Genetic Algorithm

Abstract

The network field has been very popular in recent times and has aroused much of the attention of researchers. The network must keep working with the varying infrastructure and must adapt to rapid topology changes. Graphical representation of the networks with a series of edges varying over time can help in analysis and study. This paper presents a novel adaptive and dynamic network routing algorithm based on a Regenerate Genetic Algorithm (RGA) with the analysis of network delays. With the help of RGA at least a very good path, if not the shortest one, can be found starting from the origin and leading to a destination. Many algorithms are devised to solve the shortest path (SP) problem for example Dijkstra algorithm which can solve polynomial SP problems. These are equally effective in wired as well as wireless networks with fixed infrastructure. But the same algorithms offer exponential computational complexity in dealing with the real-time communication for rapidly changing network topologies. The proposed genetic algorithm (GA) provides more efficient and dynamic solutions despite changes in network topology, network change, link or node deletion from the network, and the network volume (with numerous routes).