Performance analysis of fault tolerant heuristic algorithms for determining optimal

Abstract

In this paper, the performance of different bio inspired algorithms are compared to obtain optimal path. Performance of different individual algorithms are analyzed for different topological weights. In networking, it is easy to find the route for static systems where once the optimal path is found, the same is used to communicate between two devices for a long time. Research has shown that it is difficult to find optimal paths for networks with dynamically changing network parameters. In this paper the focus is on performance of three fault tolerant heuristic routing algorithms for such networks. The simulation result shows that 60% of the time Ant Colony Optimization method outperformed Genetic and Beehive algorithms.