Abstract
Routing optimization is an essential computational mechanism for Internet service providers seeking to optimize network performance and traffic delivery. In order to address the problems of routing optimization, various types of routing optimization algorithms are reported till date. Genetic algorithm (GA) is one of the most popular meta-heuristic combinatorial optimization algorithms, which has been widely used for various optimization problems including network route optimization. In this study, we demonstrated how to find an optimized network path between designated source and destination in a given network with 95 nodes and 200 links using the GA. Our result shows that the GA with the lower mutation probability for reducing the wasteful search space is a comprehensive approach in this study in terms of computational challenges and routing optimization. Our investigation concludes that the GA is an efficient and alternative method of finding an optimal route so as to achieve the desired network performance and to reduce congestion control.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call