Simulation of Dijkstra Routing Algorithm full report
• 0 Vote(s) - 0 Average
• 1
• 2
• 3
• 4
• 5
 project topics Active In SP Posts: 2,492 Joined: Mar 2010 03-04-2010, 10:47 AM ABSTRACT The complete network of large number of interconnected autonomous system, each of which consists of a distinct domain, needs to communicate to different nodes to forward the information. There are various means of communications between these systems. Routing is one of them. Routing refers to the overall network wide process that determines end to end paths that datagram will take from source to destinations. There are different routing algorithms available such as BELLMAN FORD ALGORITHM which is decentralized routing algorithm and DIJKSTRA ALGORITHM which is a global routing algorithm. In global routing algorithm, each router has a complete view of the network, whereas in a decentralized routing algorithm each router has a local view consisting of its directly attached neighbours. Out of this Dijkstra Algorithm is mostly preferred as it is faster as compared to any other algorithm and its implementation is easier. In this algorithm, router based information that has been collected from other routers, builds a graph of the network which shows the locations & links of routers within themselves & in the network. These links are labeled with a number called weight or cost. If there are two links between a node and destination, the router chooses the link with the lowest weight. One of the chief advantages of Dijkstra Algorithm is that router computes routes independently using the same original status data; they do not depend on the computation of intermediate machines. Because link status messages propagate unchanged, it is easy to debug problems. Because routers perform the route computation locally, it is guaranteed to converge. Finally, because link status messages only carry information about the direct connections from a single router, the size does not depend on the number of networks in the networks in the internet. Thus, Dijkstra Algorithms scale better than distance vector algorithms. We have implemented Dijkstra Algorithm for routing purpose. Presented By: Sriram Narayanan BE- Electronics NJIT read full report http://web.njit.edu/~sn3/Project_College.pdf Use Search at http://topicideas.net/search.php wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion
 senaug82 Active In SP Posts: 1 Joined: Aug 2010 12-08-2011, 04:34 PM I like to proceed this project and implimentation, can i get the report for this project and implimentation
 VickyBujju Active In SP Posts: 36 Joined: Nov 2011 30-11-2011, 10:22 PM For More IEEE project and implimentation on Network Simulation, view... http://topicideas.org/how-to-ieee-project and implimentation-idea-based-on-network-simulation Attached Files   IEEE Simulation Projects in OMNeT++.docx (Size: 11.84 KB / Downloads: 21)