Dynamic Routing

RTTC, THIRUVANANTHAPURAM
Functions
Dynamically share information between routers
Automatically update routing table when topology change occurs
Determine the best path to destination
Purpose
Discover remote networks
Maintaining up to date routing information
Choosing the best path to destination network
Ability to find new best path if the current path is no longer
available
Routing protocols are classified based
on
Purpose : IGP or EGP
Operation : distance vector, link state or path vector
Behaviour : classful or classless
Types of dynamic routing protocols
Autonomous Systems
A group of routers under the control of a single authority - also
known as routing domain
Difference between DV & LS RPs
DISTANCE VECTOR LINK STATE
Routes are advertised as vector Complete view of network
of distance and direction topology is created
Incomplete view of network Updates are not periodic but
topology made when topology changes
Generally periodic updates
Class-ful routing protocols
Class-ful routing protocols don’t send subnet mask in
routing updates
Eg RIPv1, IGRP
Convergence
When all router’s routing table are at a state of consistency
Slower – RIP & IGRP
Faster – EIGRP & OSPF
Metric
A value used to determine which route is better than
others. (Routing table entry:[xxx/yy] yy is the metric
Bandwidth
Cost
Delay
Hop Count
Load
Reliability
Metric cntd…..
RIP – hop count
IGRP & EIGRP – bandwidth (by default), delay, load, reliability
IS-IS & OSPF – cost, bandwidth
Load Balancing
Ability to distribute packets among multiple same metric
paths
Administrative Distance
Numeric value of preference of a particular route
Route Source Default AD
Connected interface 0
Static 1
eBGP 20
EIGRP (internal) 90
IGRP 100
OSPF 110
IS-IS 115
RIP 120
EIGRP (external) 170
iBGP 200
Unknown 255
Main components of Dynamic RPs
Data structures:- tables or databases
Are a particular way of organizing data in a computer so that it
can be used efficiently
Routing protocol messages:- exchange of information
Algorithm:- finite list of steps used for accomplishing a
task, here constructing the routing table
Stability Features in Dynamic RPs
Split Horizon
Information learned about a route is not sent back out the interface it was
learned from.
Hold-down mechanisms
When a link in a route fails, that route is put in a hold-down state, where
routers neither send or receive updates about that route.
Routing Information Protocol
First generation routing protocol for IPv4 originally specified
in RFC 1058.
RIPv1 has the following key characteristics:
Routing updates are broadcasted (255.255.255.255) every 30
seconds.
The hop count is used as the metric for path selection.
A hop count greater than 15 hops is deemed infinite (too far). That
15th hop router would not propagate the routing update to the next
router.

02/09/22 16
Routing Information Protocol v2
Classless routing protocol: It supports VLSM and CIDR, because it
includes the subnet mask in the routing updates.
Increased efficiency: It forwards updates to multicast address
224.0.0.9, instead of the broadcast address 255.255.255.255.
Reduced routing entries: It supports manual route summarization on
any interface.
Secure: It supports an authentication mechanism to secure routing
table updates between neighbors.

02/09/22 17
Routing Information Protocol v2
RIP updates are encapsulated into a UDP segment, with both source
and destination port numbers set to UDP port 520.
In 1997, the IPv6-enabled version of RIP was released.
RIPng is based on RIPv2. It still has a 15-hop limitation and the
administrative distance is 120.

02/09/22 18
Timers in RIP
Routing-update timer
By default, routers send updates every 30 seconds.
A small random number is added to prevent collisions.
Route timeout
A route timeout timer is associated with a route. When it expires, the route is
marked invalid.
Route-flush timer
After the route timeout expires, the route-flush timer eventually expires,
deleting the route from the table.

02/09/22 19
Configuring RIP
To enable RIP
Router(config)# router rip
To disable RIP
Router(config)# no router rip
To view RIP
Router# show ip protocols
Router# show ip route
network network-address
Enables RIP on all interfaces that belong to a specific network. Associated
interfaces now both send and receive RIP updates.

02/09/22 20
 Configuring RIP v2
Router(config)#router rip
Router(config)#version 2
Router(config)#no auto-summary
Router(config)#passive-interface <int>

02/09/22 21
 Disadvantages of RIP
RIP version 1 does not recognize subnets.
This feature was added in RIP version 2.

Because RIP only uses hop count as a metric, packets may

be forced to take a slower route with less hops over a faster
route with more hops.
Other routing protocols use a combination of different metrics to calculate a
route.

02/09/22 22
Link state dynamic routing
Creates a complete view or topology of the network
Each router calculates the SPF algorithm & determines the cost
from its own perspective
Link State Updates (LSU)
A link is an interface on a router
Information about the state of those links are called link states
Steps in LSU
Each router learns about its own links and its own directly
connected networks
This is done by detecting that an interface is in up state or not

Each router is responsible for meeting its neighbours on directly

connected networks. Link state routers do this by exchanging hello
packets with others
Steps in LSU
Each router builds a link state packet (LSP) containing the state of
each directly connected links.
This is done by collecting all the pertinent information about neighbours
including
Neighbour ID
Link Type
Bandwidth
Steps in LSU
Each router floods the LSP to all neighbours. Those neighbours
stores all LSA received, in a database. This is again flooded until it
reaches all routers.
Each router uses the database to construct a map of the topology &
compute the best path to each destination
SPF algorithm is used for this
This process is same for OSPFv2 & v3
OSPF Areas
An OSPF network can be divided into sub-domains called areas.
An area is a logical collection of OSPF networks, routers, and links
that have the same area identification.
A router within an area must maintain a topological database for the
area to which it belongs.
The router doesn't have detailed information about network
topology outside of its area, thereby reducing the size of its database.
OSPF Areas
Areas limit the scope of route information distribution.
It is not possible to do route update filtering within an area.
The link-state database (LSDB) of routers within the same area must
be synchronized and be exactly the same; however, route
summarization and filtering is possible between different areas.
The main benefit of creating areas is a reduction in the number of
routes to propagate—by the filtering and the summarization of routes.
Thank you…………….