LINK STATE ROUTING

PROTOCOLS
CN PRESENTATION
 TASK OF ALL
MEMBERS
• Mubashar – Overview of link
Group Members State Routing Protocols
Muhammad Faizan Naeem 21011519-170 • Faizan – Examples of Link State
Mubashar Mehmood 21011519-104 Routing Protocols

Amam Qasier 21011519-146 • Amam – Difference between

Distance Vector Routing
Ehtisham 20021519-013
Protocols & Link State Routing
Protocols
• Ehtisham – Commands to enable
Link State Routing Protocols on
Cisco Packet Tracer
 Link State Routing Protocol Flooding
What are link State Routing • Flooding is a mechanism
Protocols used in computer networks
to circulate information to
 Link-state routing protocols are a type of routing all nodes in the network.
protocol used in computer networks to determine
• When a node wants to send
the best path for data to travel from one device to
a message to all other
another.
nodes in the network, it
 In a link-state routing protocol, each device on broadcasts the message to
the network maintains a database of information all of its neighbors
about the network topology, including the status
• Who then forward the
of all links and the devices connected to them.
message to all of their
This information is exchanged with other devices
neighbors, and so on, until
using a flooding mechanism, so that each device
every node in the network
has a complete picture of the network topology.
has received the message.
 Every Router has its packet known as Link State
• Each node get the Global
packet which holds the information of neighbors
knowledge.
and distance of the links attach to Router.
Dijkstra's algorithm
 Start at the beginning node and assign it a
distance of 0. Factors for finding
 Consider all the neighboring nodes of the current
node and calculate their distance from the
best path
beginning node. Link bandwidth
 If the new calculated distance is less than the Link bandwidth refers to the capacity of
distance previously assigned to the neighboring a network link to transmit data
node, update the distance.
 Mark the current node as visited and move to the Delay
node with the shortest distance that has not yet Delay refers to the time it takes for data
been visited. packets to travel from one point in the
 Once you reach the destination node, the shortest network to another
path can be found by tracing back from the
destination node to the beginning node using the Congestion
updated distances. Congestion occurs when there is too
Using Dijkstra's algorithm, each device can calculate much data being transmitted over a
the shortest path to reach any other device on the network link, leading to slower
network. transmission
Examples of Link State Routing
Protocols OSPF – Open shortest path first
• OSPF IS-IS – Intermediate System to
• IS-IS Intermediate System
a) OSPF
 OSPF is a link-state routing protocol for
exchanging routing information in a single AS
network.
 OSPF uses link-state advertisements (LSAs) to
share information about the network topology
 OSPF calculates the shortest path to every
network in the AS using the Dijkstra
algorithm.
 OSPF uses a hierarchical design with areas to
minimize the amount of routing information
exchanged between routers.
 OSPF supports multiple paths to a destination,
route summarization, authentication, and has a
fast convergence time.
 OSPF is a scalable and widely used routing
protocol in large enterprise
b) IS-IS
 IS-IS is a link-state routing protocol used to
exchange routing information within a single
(AS) in a computer network.
 IS-IS uses a hierarchical design with areas to
minimize the amount of routing information
exchanged
 IS-IS routers exchange information about the
network topology using link-state packets
(LSPs).
 IS-IS calculates the shortest path to every
network in the AS using the Dijkstra algorithm.
 IS-IS supports both IP and non-IP protocols,
making it versatile for different types of
networks.
 IS-IS provides fast convergence times and
scalability, making it suitable for service
provider networks.
 Difference b/w OSPF and IS-IS

OSPF IS-IS
OSPF operates on the Internet Protocol IS-IS operates on the data link layer and
(IP) layer and is primarily used in IP can be used with multiple network layer
networks protocols
OSPF has a more rigid hierarchical IS-IS allows for a more flexible hierarch
structure
OSPF uses a tree-like network topology IS-IS uses a mesh-like network topology
OSPF is more widely used in enterprise IS-IS is more commonly used in service
networks provider networks
OSPF supports several authentication IS-IS uses a simple password
methods, including plaintext, MD5, and authentication
SHA-1
Difference b/w Distance Vector Routing Protocol and
Link State Routing Protocol

DVRP LSRP
Distance vector protocols determine Link state protocols determine routing
routing information by using the information by using the Dijkstra’s
Bellman-Ford algorithm algorithm
Distance vector protocols typically send Link state protocols, however, only send
updates at regular intervals updates when there is a change in the
network topology
Distance vector protocols rely on periodic Link state protocols, converge quickly
updates, they can take longer to converge because they immediately flood the
network with information
Distance vector protocols can suffer from Link state protocols are more scalable
scalability issues in large networks
 • Here are the steps to enable
OSPF on a Cisco router:

Commands to enable link state Step 1: Enter the OSPF

routing protocols process ID to enable OSPF on a
router The command to enter
 Link state routing protocols use a different the OSPF process ID is:
approach to routing than distance vector Router(config)# router ospf
protocols. They rely on building a complete and <process ID>
accurate map of the network, which is then used
to calculate the shortest path between any two Step 2: Define the OSPF
points. Here are some commands to enable link network
state routing protocols: The command to define the
OSPF network is:
a) OSPF (Open Shortest Path First) Router(config-router)# network
<network ID> <wildcard mask>
area <area ID>
ANY QUESTION
Thank you