Finding Shortest Path TCP Routing by Modified Dijkstra’s Algorithm

Abstract

With the significant increment of today’s network, there is a decrease in the efficiency of the network. The performance and reliability of the Internet depend, in large part, on the operation of the routing protocols. Routing protocols compute paths based on the network topology and configuration parameters. This paper presents the enhancing network routing by using modified Dijkstra’s shortest path algorithm and focuses on distance. The proposed system identifies the shortest route faster than Dijkstra’s algorithm. It provides optimized route by refining the steps in the Dijkstra’s algorithm for computing and network efficiency. Simulation system is implemented for routers using java programming language.