Routing in networks using genetic algorithm

被引:5
作者
Moza, Meenakshi [1 ]
Kumar, Suresh [1 ]
机构
[1] Manav Rachna Int Univ, Faridabad 121001, Haryana, India
关键词
genetic algorithm; GA; open shortest path first; OSPF; quality of service; QOS; chromosome; mutation; routing;
D O I
10.1504/IJCNDS.2018.10010684
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:291 / 311
页数:21
相关论文
共 30 条
[1]  
Ahmed Y., 2015, INT J COMPUTER NETWO, V7, P75
[2]  
Al-Ghazal Mustafa, 2007, 2007 IEEE International Symposium on Signal Processing and Information Technology, P497, DOI 10.1109/ISSPIT.2007.4458010
[3]  
[Anonymous], [No title captured]
[4]   Genetic Algorithm based Congestion Aware Routing Protocol (GA-CARP) for Mobile Ad Hoc Networks [J].
Baboo, S. Santhosh ;
Narasimhan, B. .
2ND INTERNATIONAL CONFERENCE ON COMPUTER, COMMUNICATION, CONTROL AND INFORMATION TECHNOLOGY (C3IT-2012), 2012, 4 :177-181
[5]  
Chandel G., 2012, INT J ADV RES COMPUT, V2, P445
[6]   Study on a Fast OSPF Route Reconstruction Method Under Network Failures [J].
Doi, Hiroki .
E-BUSINESS AND TELECOMMUNICATIONS, ICETE 2012, 2014, 455 :21-35
[7]  
Fadil Y. A., 2010, DIYALA J ENG SCI, V3, P53
[8]   Improving Convergence Speed and Scalability in OSPF: A Survey [J].
Goyal, M. ;
Soperi, M. ;
Baccelli, E. ;
Choudhury, G. ;
Shaikh, A. ;
Hosseini, H. ;
Trivedi, K. .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2012, 14 (02) :443-463
[9]  
Graziani R., 2008, ROUTING PROTOCOLS CO, P1
[10]   A genetic algorithm for finding the k shortest paths in a network [J].
Hamed, Ahmed Younes .
EGYPTIAN INFORMATICS JOURNAL, 2010, 11 (02) :75-79