SHORTEST PATH ROUTING netwinz

netwinz
SHORTEST PATH ROUTING
Introduction:
Shortest Path or Dijkstra's algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1956 is a graph search algorithm that solves the single-source shortest path problem for a graph with nonnegative edge path costs, producing a shortest path tree. This algorithm is often used in routing and as a subroutine in other graph algorithms.
For a given source vertex (node) in the graph, the algorithm finds the path with lowest cost (i.e. the shortest path) between that vertex and every other vertex. It can also be used for finding costs of shortest paths from a single vertex to a single destination vertex by stopping the algorithm once the shortest path to the destination vertex has been determined. For example, if the vertices of the graph represent cities and edge path costs represent driving distances between pairs of cities connected by a direct road, Dijkstra's algorithm can be used to find the shortest route between one city and all other cities. As a result, the shortest path first is widely used in network routing protocols, most notably IS-IS and OSPF (Open Shortest Path First).
netwinz Guide
HOW TO CONDUCT THE EXPERIMENT:
Click on Network Layer on the Main Window and Then Select "SHORTEST PATH" Module from the Modules displayed in the centre of the window.
IP Entry window will open up as shown in SNAPSHOT-1.
SNAPSHOT-1
1. Enter Ip Addresses of all the computers that will run as router nodes.
Please note that the order of entry on all computers running this module has to be same.
Click on "OK" button to continue.
Shortest Path Configuration window will open up as shown in SNAPSHOT-2
SNAPSHOT-2
1. Enter the own node number corresponding to the ip address shown in "IP ADDRESS" table on the right of the window.
For ex : In the SNAPSHOT-2 , if the IP ADDRESS of your computer is 192.168.0.100 then enter own node as 1.
2. Enter Total Nodes in the Network. Total nodes cannot be greater than the "IP ADDRESS" entered.
3. Enter the distance between nodes in the "DISTANCE TABLE" towards left of the window.
4. Click OK to Continue.
"SHORTEST PATH WINDOW" will open up as shown in SNAPSHOT-3
SNAPSHOT-3
Network Graph is shown at the top.
Received Messages are shown in "RECEIVED MESSAGES" Window.
Click on "SHOW ROUTING TABLE" button to display the Routing Table.
Enter Destination Node in "DESTINATION NODE" textbox and Enter Message in "ENTER MESSAGE" textbox and click on "SEND" button to send the data to the destination. The data can be seen to go through the path as shown in Routing Table. See SNAPSHOT-4
SNAPSHOT-4
Click on "HELP BUTTON" to Open This Manual.
Click on "QUIT BUTTON" To Close this Window.
Copyright © 2011 Emblitz Technologies Pvt Ltd. All rights reserved. www.netwinz.com

Category:

Education

Tags:

• netwinz
• ALOHa
• netsim
• tetcos
• ALOHAnet
• computer
• networking simulation
• emulation
• emblitz
• Bangalore
• India
• FREE Down load www.netwinz.com