Comparative Analysis of Shortest-Path Algorithms in Network Routing

Large and dynamic networks consist of a large number of routers and links which makes the process of routing very challenging on complex networks. This emphasizes the importance of having efficient routing algorithms that are used to find the shortest path for a data packet to reach the destination system. There are three major algorithms to calculate the efficient path - Dijkstra, Bellman- Ford, and Floyd-Warshall. This paper has analyzed the performance efficiency of these algorithms based on their convergence time, memory required, scalability, and stability. After analysis, it was found that Dijkstra's algorithm is more efficient for calculating the shortest path, especially for a large number of nodes.