Networks and

communication
Module 5
Routing protocols (Part 2)
 Outline
• Link State Routing
• Reliable Flooding
• Example
• Implementation
• Performance analysis
• Packet Tracer
 Link State Routing
• Initial state : similar to distance vector i.e., state of
link to neighbors known (up/down).
• goal: To find the path of least cost to destination.
• Basic Idea -- Every node knows how to reach its
neighbors. If this info is dissemination to every
node, every node ultimately has the info. to build
the complete map of the network.
 Mechanisms
• Two mechanisms:
– Reliable dissemination of link state
information -- process is called reliable
flooding.
– calculation of routes using the collected
information -- the computation is based on
Dijkstra’s algorithm.
 Reliable Flooding
• Process of making sure that all the nodes
participating in the link state routing protocol
get a copy of the link-state info. from all other
nodes.
• Each node sends out link-state information on
its directly connected links.
• Each node that receives this, forwards it.
 Link State Information
• Each node creates a link-state packet (LSP) that
contains:
– ID of the node that created LSP
– a list of directly connected nodes and the cost
to each node.
– sequence number
– TTL } for reliability
 An Example
– X receives LSP from some node Y.
– X checks to see if it already has an
update from Y. If it does, it
compares the sequence number in X A X A

the new LSP to the one stored.

C B D C B D
– If New seq no < Old sequence (a) (b)

number, then, discard LSP.

– Else -- store LSP and send the LSP X A X A

to all neighbors except the one

C B D C B D
that sent the LSP. (c) (d)
– If no update from Y, keep it.
 Dissemination of LSPs
– LSPs are sent periodically (upon the expiry of a timer)
or may be triggered due to a change in topology (as in
RIP).
– The only topology change that triggers the creation of
a new LSP is a change to one of the directly connected
links.
• Failures detected by link layer protocol by using
what are known as “HELLO” packets -- probes to
determine if neighbor is alive.
 Dissemination of LSPs
– To minimize overhead, LPSs are not created
unless needed --periodicity is of the order
of hours.
– Sequence numbers help in identifying new
info and TTL helps in ensuring that packets
don’t stay in the network indefinitely.
 Graph abstraction
– Used for computation of shortest path using
Dijkstra’s.
– Let N denote the set of nodes in the graph.
– l(i,j) denotes the non-negative cost or weight
associated with the edge between nodes i and j.
– l(i,j) = ∞ if there is no edge between i and j.
– Remember -- each node has entire map of network.
 An Example

3 B 2
7
A C
8
1
D
 OSPF (Open Shortest Path First)

• “Open”: publicly available

• Uses Link State algorithm

– link state (LS) packet dissemination
– topology map at each node
– route computation using Dijkstra’s algorithm
 OSPF “Advanced” Features (not in RIP)

• Multiple same-cost paths allowed (only one path in

RIP)
• For each link, multiple cost metrics for different Type
Of Service (eg, satellite link cost set “low” for best
effort; high for real time)
• Security: all OSPF messages authenticated (to
prevent malicious intrusion); TCP connections used
• Hierarchical OSPF
 Hierarchical OSPF

Boundary Router
Backbone

Area 0
Area Backbone Router
- Link-state advertisements runs OSPF routing limited
to backbone.
only in area .
- each nodes has detailed area Area 1
Area 2
topology;
- only know direction
(shortest path) to nets in
other areas. Area Border Router

” distances to nets in own area,

advertise summarize to other Area
Border routers.

Two-level hierarchy: local area, backbone

 Implementation
• There is a very simple way to build a switch or router:
– Buy a general-purpose processor and equip it with
a number of network interfaces. Such a device,
running suitable software, can receive packets on
one of its interfaces, perform any of the switching
or forwarding functions, and send packets out
another of its interfaces.
 Block diagram of Router

Source: Computer Networks:

A Systems Approach, Larry Peterson and Bruce Davie, 5th Ed, The Morgan
Kaufmann Series, Elsevier, 2011.
 Performance analysis
• Key Differences Between RIP and OSPF based on performance
– RIP depends on hop counts to determine the best path while OSPF depends
on cost (bandwidth) which helps in determining the best path.
– Administrative Distances (AD) measures the probity of received routing
information on a router from a neighbor router. An administrative distance
can vary from integers 0 to 255, where 0 specifies the most trusted integer,
and 255 signifies that no traffic is allowed to pass through this route. The AD
value of RIP is 120 whereas it is 110 for OSPF.
– Convergence in the RIP is slow in contrast it is fast in OSPF.
– Summarization allows a single routing table entry to illustrate a collection of
IP network numbers. RIP supports auto summarization, as against OSPF
supports manual summarization.
– There no hop count limit in OSPF. On the contrary, the RIP is limited to 15
hop counts.
 Packet Tracer
• Packet Tracer is a cross-platform visual
simulation tool designed by Cisco Systems that
allows users to create network topologies and
imitate modern computer networks.
• The software allows users to simulate the
configuration of Cisco routers and switches
using a simulated command line interface.
https://www.wikihow.com/Configure-a-Network-on-Cisco-Packet-Tracer
 Packet tracer
Step 1:
• Open your Network
Topology. Once you've
opened your Network
Topology on Cisco Packet
Tracer, access your
network and identify the
components of your
network, for example;
Servers, Routers, End
Devices, etc.
 Packet tracer
Step 2:
• Complete the
cabling. Access the cables
section and connect
completely and correctly
the cables between the
network in order to
ensure connectivity
between the devices in
the network using the
connections table given.
 Packet tracer
Step 3:
• Open your Network
Topology. Once you've
opened your Network
Topology on Cisco Packet
Tracer, access your
network and identify the
components of your
network, for example;
Servers, Routers, End
Devices, etc.
 Packet tracer
• Step 4:
• Configure the IP addresses on
your routers and
switches. After configuring the
right IP addresses on the end
devices, you will have to do the
same on the routers and
switches also, using the
address table. But this time in a
different way because there's
no desktop platform on the
routers and switches.
 Packet tracer
Step 5:
• Configure your default
gateway. After configuring
the IP addresses, you will
need to configure the default
gateway also. The reason for
this is so the end devices
would know what network
they are operating on. You
can find the default gateway
either in the addressing table
(if given) or in the network
topology.
 Packet tracer
Step 6:
• Test connectivity. After
configuring the addresses,
you will have to test
connectivity by opening a
command prompt window
on the end devices and try
pinging the address which
the network operates on. If
it gives you a reply, it
means your network was
configured correctly.