Scribd
Upload
12 views8 pages

Link State Routing Algorithm

Uploaded by

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

Link State Routing Algorithm

Uploaded by

rohansengupta22
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 8

Link-State

Routing
Algorithm
Link-State Routing is a network routing algorithm that
calculates the shortest paths between nodes in a
network. It's used to efficiently route data packets
through complex network environments.

preencoded.png
Introduction to Link-State
Routing
1 Shortest Path Calculation
Link-State Routing relies on link costs to determine the
shortest path between any two nodes in a network.

2 Link Costs
Each link between nodes has a cost, representing the relative
difficulty or expense of using that connection.

3 Network Efficiency
The algorithm aims to optimize data routing by choosing
paths with minimal overall costs, reducing network
congestion and delays.
preencoded.png
Link-State Database (LSDB)
• LSDB contains a complete map of the network's link costs.
• Each node has a copy of this database.
• The database is represented as a matrix, where each cell indicates a link's cost.

preencoded.png
Creation of LSDB via Flooding
Step 1: LSP Creation
Each node creates a Link-State Packet (LSP) containing
information about its directly connected neighbors and the
cost of each link.

Step 2: Flooding
Each node broadcasts its LSP to all its neighbours, who then
forward the LSP to their neighbours, and so on, until all nodes
in the network have received it.

Step 3: LSDB Formation


As each node receives LSPs, it adds the information to its
LSDB, building a comprehensive map of the entire network's
link costs

preencoded.png
Comparison with Distance-Vector Routing

Distance-Vector Routing Link-State Routing


Routers share their knowledge of the Routers share their knowledge of
entire network with their immediate their local link costs with the entire
neighbors. network.
• Focus on distances to destinations • Focus on direct link costs
• Information shared only with neighbors • Information shared with all nodes
• Susceptible to routing loops and instability • More efficient and stable routing

preencoded.png
Formation of Least-Cost Trees
1 Step 1: Root Selection
Each node selects itself as the root of
its own least-cost tree.

2 Step 2: Nearest Node Addition


The node adds the nearest node to the
tree, based on the lowest link cost.

3 Step 3: Path Update


The node updates its path to other nodes
based on the new connections in the tree.

preencoded.png
Dijkstra's Algorithm Steps
1 Step 1: Initialization
Create a tree containing only the root node, with initial distances to other nodes based on the LSDB.

2 Step 2: Nearest Node Selection


Identify the node with the lowest cost that is not yet included in the tree.

3 Step 3: Cost Update


For each node connected to the newly added node, update the distances in the tree if a
shorter path is found.

4 Step 4: Repeat
Continue steps 2 and 3 until all nodes are added to the tree, resulting in a complete least-cost tree.
preencoded.png
Conclusion
Efficient Routing
Link-State Routing creates least-cost trees,
ensuring efficient routing of data packets
throughout the network.

Real-Time Updates
The flooding of LSPs and the use of Dijkstra's
Algorithm ensure real-time updates to the
network topology as link costs change.

preencoded.png

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy