A survey on network path identification using bio inspired algorithms

Network path identification is an important problem in networks. It is important to identify routing path for data transfer from a source to destination. Network path found should be feasible in overcoming congestion, real time data transfer. This paper reviews three different methods to find network path identification using biologically inspired algorithms in different scenarios. It will provide an overview of path identification in different networks.

[1]  Benjamín Barán,et al.  Omicron ACO. A New Ant Colony Optimization Algorithm , 2018, CLEI Electron. J..

[2]  Eryk Dutkiewicz,et al.  A review of routing protocols for mobile ad hoc networks , 2004, Ad Hoc Networks.

[3]  Donald B. Johnson,et al.  A Note on Dijkstra's Shortest Path Algorithm , 1973, JACM.

[4]  Kai Zhang,et al.  An improved ant colony optimization for communication network routing problem , 2009, 2009 Fourth International on Conference on Bio-Inspired Computing.

[5]  Miao Li,et al.  Study of population diversity of multiobjective evolutionary algorithm based on immune and entropy principles , 2001, Proceedings of the 2001 Congress on Evolutionary Computation (IEEE Cat. No.01TH8546).

[6]  Om Prakash Verma,et al.  A new approach to dynamic network routing using Omicron Ant Colony algorithm , 2011, 2011 3rd International Conference on Electronics Computer Technology.

[7]  Yinguo Li,et al.  Hybrid of Genetic Algorithm and Particle Swarm Optimization for Multicast QoS Routing , 2007, 2007 IEEE International Conference on Control and Automation.

[8]  K. E. Tho,et al.  A Survey : Swarm Intelligence vs . Genetic Algorithm , 2014 .