11-04-2014, 02:30 PM
SIMULATION OF ROUTING PROTOCOLS
AIM
To Simulate Shortest Path Routing Algorithm
ALGORITHM
Step 1: Start the Program
Step 2: Create a distance list, a previous vertex list, a visited list, and a current vertex.
Step 3: All the values in the distance list are set to infinity except the starting vertex which is set to zero.
Step 4: All values in visited list are set to false.
Step 5: All values in the previous list are set to a special value signifying that they are undefined.
Step 6: Current node is set as the starting vertex.
Step 7: Mark the current vertex as visited.
Step 8: Update distance and previous lists based on those vertices which can be immediately reached from the current vertex.
Step 9: Update the current vertex to the unvisited vertex that can be reached by the shortest path from the starting vertex.
Step 10: Repeat (from step 6) until all nodes are visited.
Step 11: Stop the program execution.
RESULT:
Thus the Program for simulating Shortest Path Routing Algorithm is executed and the output is verified successfully.