Effective Shortest Path using Fusion Dynamic Routing Algorithm

Abstract

Internet is important source in all over the world; it will increase the internet users. This will heavy load to the network. It is a very big task for network to deliver the packets in efficient way. Network routing is one of the necessary processes in computer using various routing algorithms. The various routing algorithms are used to deliver the message to suitable port address. So the network in need of efficient algorithm to deliver the packets its destinations. Shortest path should be detected by routing algorithm. In this paper we introduced a new efficient algorithm to find the shortest path. The proposed algorithm efficiently delivered the packets using shortest path with fast delivery ratio. The proposed algorithm is focusing the packet delivery ratio, delay ratio and shortest path. This algorithm implemented by using NS2 simulator. Simulation results give significant improvement.