Scribd
Upload
397 views7 pages

11 Implementation of Distance Vector Routing Algorithm

The document describes the procedure to implement a distance vector routing algorithm using N-SIM software. Key steps include adding up to 8 routers, defining links between router pairs and their costs, simulating the algorithm to find the shortest path, and analyzing the time and message complexity by varying the number of routers and links.

Uploaded by

Manimegalai
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
397 views7 pages

11 Implementation of Distance Vector Routing Algorithm

The document describes the procedure to implement a distance vector routing algorithm using N-SIM software. Key steps include adding up to 8 routers, defining links between router pairs and their costs, simulating the algorithm to find the shortest path, and analyzing the time and message complexity by varying the number of routers and links.

Uploaded by

Manimegalai
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 7

OBJECTIVE:

Implementation of distance vector routing algorithm.

EQUIPMENTS:
• N-SIM
• Computer with win-2K / XP
PROCEDURE:
1. Run N-SIM software from your computer.
2. To check working of distance vector routing algorithm in the form of animated
representation click on distance vector routing under routing protocols.

3. You can study the working of distance vector routing algorithm through this
animated movie.
4. To implement this algorithm click on algorithms under menu and click on
distance vector routing.
5. Add the number of routers you want to, select one by one, maximum 8 routers
can be added, all the added routers will appear in the window.
6. Select the routers from ‘Start’ and ‘End’ Combo Box. Enter the cost in Weight
Textbox.
7. Click “Add Link” button to define the links between pair of routers and define
its cost in kilometers.
8. Depending on the configuration you will see all the possible links defined by
you are implemented and drawn in the screen near the routers added.
9. You can edit cost by selecting the respective ‘Start’ and ‘End’ Combo box;
enter the cost in ‘Weight’ textbox and click on the “Add Link” button. Cost of
respective links between pair of router can be changed.

10. To simulate and find out shortest path select the source and destination
routers.
11. Click on simulate button to start the algorithm, this will calculate the shortest
path and will be shown on the screen.

12. Click on “Delete Router” to delete the router and its entire links.
13. Click on the “Summary” button to see the parameters for shortest path.
14. Click on “Save” button to save the summary in excel sheet.

Generic Definition of Time Complexity:

The way in which the number of steps required by an algorithm varies with the
size of the problem it is solving. Time complexity is normally expressed as an
order of magnitude, e.g. O(N^2) means that if the size of the problem (N)
doubles then the algorithm will take four times as many steps to complete

Generic Definition of Message Complexity:

Number of messages sent between nodes called connection communication


complexity

15. Click on “Time Complexity” or “Message Complexity” button to plot the


readings against the various parameters.
16. Select the parameters from Combo Box on top “Time Complexity Vs Number
Of Router” or “Message Complexity Vs Number Of Router”.
17. Select Number of Link from Combo box same as Router.
18. Click on “Save” button to save the Graph.
19. Click on “Print” button to print the Graph.

You might also like