UCSY's Research Repository

Finding Shortest Path TCP Routing by Modified Dijkstra’s Algorithm

Show simple item record

dc.contributor.author Win, Zin Me Me
dc.contributor.author Maw, Tin Win
dc.date.accessioned 2019-07-22T07:06:02Z
dc.date.available 2019-07-22T07:06:02Z
dc.date.issued 2010-12-16
dc.identifier.uri http://onlineresource.ucsy.edu.mm/handle/123456789/1145
dc.description.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. en_US
dc.language.iso en en_US
dc.publisher Fifth Local Conference on Parallel and Soft Computing en_US
dc.title Finding Shortest Path TCP Routing by Modified Dijkstra’s Algorithm en_US
dc.type Article en_US

Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Repository


My Account