Scribd
Upload
86 views2 pages

Link State Routing Algorithm Implementation

The document discusses implementing the link state routing algorithm using a network simulator. It provides background on link state routing, noting that each router maintains a map of the network and floods link state advertisements when a link changes state. Routers then recompute routes using Dijkstra's algorithm. The procedure uses a simulator with 7 connected nodes to select any two nodes and calculate the minimum hop count path between them. The result is that the link state routing algorithm was successfully demonstrated using the simulator.

Uploaded by

boy vs girls
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
86 views2 pages

Link State Routing Algorithm Implementation

The document discusses implementing the link state routing algorithm using a network simulator. It provides background on link state routing, noting that each router maintains a map of the network and floods link state advertisements when a link changes state. Routers then recompute routes using Dijkstra's algorithm. The procedure uses a simulator with 7 connected nodes to select any two nodes and calculate the minimum hop count path between them. The result is that the link state routing algorithm was successfully demonstrated using the simulator.

Uploaded by

boy vs girls
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd

Ex No: 10 LINK STATE ROUTING ALGORITHM

Date :

AIM:
To implement the link state routing algorithm by using network simulator.

APPARATUS REQUIRED:

Sl No Particulars Quantity
1 Personal Computer
2 Simulator (Vi RT Sim)

THEORY:

LINK STATE ROUTING

This type of routing protocol requires each router to maintain at least a partial map of the
network. When a network link changes state (up to down, or vice versa), a notification,
called a link state advertisement (LSA) is flooded throughout the network. All the routers
note the change, and recompute their routes accordingly. This method is more reliable,
easier to debug and less bandwidth-intensive than Distance-Vector. It is also more complex
and more compute- and memory-intensive. OSPF and OSI's IS-IS are link state routing
protocols.

It uses Dijkstras algorithm to calculate the cost between networks.

Link-state protocols are generally more scalable than distance vector protocols.

Working Principles:

1. Knowledge about the neibourhood


2. Sends information to all routers
3. Information sharing when there is a change
PROCEDURE:

 Switch ON the system and open the Simulator software named Vi-Rt Sim.
 Now to select LINK STATE ROUTING menu.
 The LINK STATE ROUTING window opens as shown in the diagram.
 The window shows of seven nodes (Router) that are connected in some manner.
 To calculate best path, we select any two nodes.
 To find the path click the Find Path button and press calculate button.
 It shows the minimum hop count path, all possible paths between these two nodes.

We can also add a new Router or Create a new links between routers are possible for
calculating best paths between any two nodes.

RESULT:

Thus the link state routing algorithm was implemented using simulator.

You might also like