Network Throughput Improvement using Dijkstra’s and Floyd Warshall Algorithm

In now a day’s explosion of digital world results in faster, easily accessible, most efficient, reliable communication over the network communication to exchange the information. Considering this advantages, this paper introduced the network on which shortest path algorithm implemented to communicate number of nodes on network in shortest, efficient path with efficient throughput mechanism. In this paper Dijkstra and Floyd Warshall algorithms are implement to find shortest and efficient path. In the simulation, it estimates parameters the throughput, arrival and blocking rate with packet error rate and signal to noise ratio. The routing algorithms are compared on the basis of parameters and better results estimated in network simulator NS2 software.