Routing in networks using genetic algorithm Online publication date: Mon, 09-Apr-2018
by Meenakshi Moza; Suresh Kumar
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 20, No. 3, 2018
Abstract: With the recent increase in the traffic, internet service providers are forced to seek solutions for better and improved services within the available resources. While the current traffic loads have to be taken into account for computation of paths in routing protocols, network applications require the shortest paths to be used for a speedy communication. The open shortest path first (OSPF) is the routing algorithm used to find the shortest path from source to destination, however, the overloading of the path or link congestion exposes the limitations of OSPF. This shortcoming can be overcome by optimisation of the network through the application of genetic algorithm, as it provides a valuable alternative to the overloaded path between the source and the destination. This paper proposes a distinct method of calculating the shortest path in a network by extending OSPF algorithm with genetic algorithm (OSGA) for achieving the desired improved performance.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook