Home > Archives > IJSRST173132
Effective Shortest Path using Fusion Dynamic Routing Algorithm
Authors(2) :-R. Pradeepa, T. Sowmya
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.
Routing, Packet, Fusion Dynamic
Published in : Volume 3 | Issue 1 | January-February 2017
Date of Publication : 2017-02-28
License: This work is licensed under a Creative Commons Attribution 4.0 International License.
Page(s) : 181-184
Manuscript Number : IJSRST173132
Publisher : Technoscience Academy
PRINT ISSN : 2395-6011
ONLINE ISSN : 2395-602X
Cite This Article :
R. Pradeepa, T. Sowmya, "Effective Shortest Path using Fusion Dynamic Routing Algorithm", International Journal of Scientific Research in Science and Technology(IJSRST), Print ISSN : 2395-6011, Online ISSN : 2395-602X, Volume 3, Issue 1, pp.181-184, January-February-2017
URL : http://ijsrst.com/IJSRST173132