CCNA 200-301 Day 24
Introduction to Dynamic Routing
Things we’ll cover
●
Introduction to dynamic routing protocols
●
Types of dynamic routing protocols
●
Dynamic routing protocol metrics
●
Administrative distance
Dynamic Routing
Network route: A route to a network/subnet
(mask length < /32)
G0/0 G0/0
R1 R2
.1 .2 Host route: A route to a specific host (/32 mask)
[Link]/30
G1/0 .1 .1 G1/0
[Link]/30
[Link]/30
G0/0 .2 .2 G0/0
R3 R4
G1/0 .254
[Link]/24
Dynamic Routing
ADVERTISEMENT
You can reach [Link]/24 via me.
G0/0 G0/0
R1 R2
.1 .2
[Link]/30
G1/0 .1 .1 G1/0
[Link]/30
ADVERTISEMENT
You can reach [Link]/24 via me.
[Link]/30
G0/0 .2 .2 G0/0
R3 R4
ADVERTISEMENT
You can reach [Link]/24 via me.
G1/0 .254
[Link]/24
Dynamic Routing
G0/0 G0/0
R1 R2
.1 .2
[Link]/30
G1/0 .1 .1 G1/0
[Link]/30
[Link]/30
G0/0 .2
R3
x
.2 G0/0
R4
G1/0 .254
[Link]/24
Static Routing
G0/0 G0/0
R1 R2
.1 .2
[Link]/30
G1/0 .1 .1 G1/0
[Link]/30
[Link]/30
G0/0 .2
R3
x
.2 G0/0
R4
G1/0 .254
[Link]/24
Dynamic Routing
G0/0 G0/0
R1 R2
.1 .2
[Link]/30
G1/0 .1 .1 G1/0
[Link]/30
[Link]/30
G0/0 .2 .2 G0/0
.1 [Link]/30 .2
R3 R4
F2/0 F2/0
G1/0 .254
[Link]/24
Dynamic Routing
G0/0 G0/0
R1 R2
.1 .2
[Link]/30
G1/0 .1 .1 G1/0
[Link]/30
[Link]/30
G0/0 .2
R3
.1 [Link]/30 .2
x
.2 G0/0
R4
F2/0 F2/0
G1/0 .254
[Link]/24
Dynamic Routing
●
Routers can use dynamic routing protocols to advertise information about the
routes they know to other routers.
●
They form ‘adjacencies’ / ‘neighbor relationships’ / ‘neighborships’ with adjacent
routers to exchange this information.
●
If multiple routes to a destination are learned, the router determines which route is
superior and adds it to the routing table. It uses the ‘metric’ of the route to decide
which is superior (lower metric = superior).
Types of Dynamic Routing Protocols
●
Dynamic routing protocols can be divided into two main categories:
IGP (Interior Gateway Protocol)
EGP (Exterior Gateway Protocol).
●
IGP = used to share routes within a single autonomous system (AS), which is a single
organization (ie. a company)
●
EGP = used to share routes between different autonomous systems
ISP B
ISP A
Company B
Company A
Types of Dynamic Routing Protocols
(Algorithm type)
Routing Information Protocol (RIP)
IGP Distance Vector
Enhanced Interior Gateway Routing
Protocol (EIGRP)
Link State Open Shortest Path First (OSPF)
Intermediate System to Intermediate
System (IS-IS)
Path Vector Border Gateway Protocol (BGP)
EGP
Distance Vector Routing Protocols
●
Distance vector protocols were invented before link state protocols.
●
Early examples are RIPv1 and Cisco’s proprietary protocol IGRP (which was
updated to EIGRP)
●
Distance vector protocols operate by sending the following to their directly
connected neighbors:
→ their known destination networks
→ their metric to reach their known destination networks
●
This method of sharing route information is often called ‘routing by rumor’
●
This is because the router doesn’t know about the network beyond its neighbors.
It only knows the information that its neighbors tell it.
●
Called ‘distance vector’ because the routers only learn the ‘distance’ (metric) and
‘vector’ (direction, the next-hop router) of each route.
Distance Vector Routing Protocols
ADVERTISEMENT
You can reach [Link]/24 via me.
My metric to reach it is 2.
G0/0 G0/0
R1 R2
.1 .2
[Link]/30
G1/0 .1 .1 G1/0
[Link]/30
ADVERTISEMENT
You can reach [Link]/24 via me.
[Link]/30
My metric to reach it is 3.
G0/0 .2 .2 G0/0
R3 R4 ADVERTISEMENT
You can reach [Link]/24 via me.
My metric to reach it is 1.
G1/0 .254
[Link]/24
Link State Routing Protocols
●
When using a link state routing protocol, every router creates a ‘connectivity map’
of the network.
●
To allow this, each router advertises information about its interfaces (connected
networks) to its neighbors. These advertisements are passed along to other
routers, until all routers in the network develop the same map of the network.
●
Each router independently uses this map to calculate the best routes to each
destination.
●
Link state protocols use more resources (CPU) on the router, because more
information is shared.
●
However, link state protocols tend to be faster in reacting to changes in the
network than distance vector protocols.
Dynamic Routing Protocol Metrics
●
A router’s route table contains the best route to each destination network it knows
about.
●
If a router using a dynamic routing protocol learns two different routes to the same
destination, how does it determine which is ‘best’?
●
It uses the metric value of the routes to determine which is best. A lower metric =
better.
●
Each routing protocol uses a different metric to determine which route is the best.
Dynamic Routing Protocol Metrics
G0/0 G0/0
R1 R2
.1 .2
[Link]/30
G1/0 .1 .1 G1/0
[Link]/30
[Link]/30
G0/0 .2 .2 G0/0
.1 [Link]/30 .2
R3 R4
F2/0
F2/0 What if this was also a gigabit Ethernet connection?
G1/0 .254 Both routes would have the same metric, so
which route would be added to the route table?
[Link]/24
Dynamic Routing Protocol Metrics
G0/0 G0/0
R1 R2
.1 .2
[Link]/30
G1/0 .1 .1 G1/0
[Link]/30
[Link]/30
G0/0 .2 .2 G0/0
.1 [Link]/30 .2
R3 R4
G1/0 G2/0
If a router learns two (or more) routes via the same routing protocol to the
same destination (sameG1/0 network
.254 address, same subnet mask) with the
same metric, both will be added to the routing table. Traffic will be load-
balanced over both routes.
[Link]/24
Dynamic Routing Protocol Metrics
ECMP (Equal Cost Multi-Path)
ECMP with Static Routes
Dynamic Routing Protocol Metrics
IGP Metric Explanation
Each router in the path counts as one ‘hop’. The total
RIP Hop count metric is the total number of hops to the destination.
Links of all speeds are equal.
Complex formula that can take into account many
Metric based on bandwidth values. By default, the bandwidth of the slowest link
EIGRP & delay (by default) in the route and the total delay of all links in the route
are used.
The cost of each link is calculated based on bandwidth.
OSPF Cost The total metric is the total cost of each link in the
route.
The total metric is the total cost of each link in the
route. The cost of each link is not automatically
IS-IS Cost calculated by default. All links have a cost of 10 by
default.
Dynamic Routing Protocol Metrics
G0/0 G0/0
R1 R2
.1 .2
[Link]/30
G1/0 .1 .1 G1/0
= RIP
[Link]/30
[Link]/30
G0/0 .2 .2 G0/0 = OSPF
.1 [Link]/30 .2
R3 R4
F2/0 F2/0
G1/0 .254
[Link]/24
Administrative Distance
●
In most cases a company will only use a single IGP – usually OSPF or EIGRP.
●
However, in some rare cases they might use two. For example, if two companies connect
their networks to share information, two different routing protocols might be in use.
●
Metric is used to compare routes learned via the same routing protocol.
●
Different routing protocols use totally different metrics, so they cannot be compared.
●
For example, an OSPF route to [Link]/24 might have a metric of 30, while an EIGRP
route to the same destination might have a metric of 33280. Which route is better? Which
route should the router put in the route table?
●
The administrative distance (AD) is used to determine which routing protocol is preferred.
●
A lower AD is preferred, and indicates that the routing protocol is considered more
‘trustworthy’ (more likely to select good routes).
Administrative Distance
Route protocol/type AD Route protocol/type AD
Directly connected 0 IS-IS 115
Static 1 RIP 120
External BGP (eBGP) 20 EIGRP (external) 170
EIGRP 90 Internal BGP (iBGP) 200
IGRP 100 Unusable route 255
If the administrative distance is 255, the router does not believe
OSPF 110 the source of that route and does not install the route in the
routing table.
Administrative Distance
●
The following routes to the destination network [Link]/24 are learned:
→ next hop [Link], learned via RIP, metric 5
→ next hop [Link], learned via RIP, metric 3
→ next hop [Link], learned via OSPF, metric 10
Which route to [Link]/24 will be added to the route table?
●
Metric is used to compare routes learned from the same routing protocol.
●
However, before comparing metrics, AD is used to select the best route.
●
The OSPF route will always take precedence over the RIP routes, because it has a lower AD.
Administrative Distance
Administrative Distance
Administrative Distance
●
You can change the AD of a routing protocol (I will demonstrate this when we cover OSPF
configuration in a later video).
●
You can also change the AD of a static route:
Administrative Distance
Floating Static Routes
●
By changing the AD of a static route, you can make it less preferred than routes learned by a
dynamic routing protocol to the same destination (make sure the AD is higher than the
routing protocol’s AD!).
●
This is called a ‘floating static route’.
●
The route will be inactive (not in the routing table) unless the route learned by the dynamic
routing protocol is removed (for example, the remote router stops advertising it for some
reason, or an interface failure causes an adjacency with a neighbor to be lost).
Things we covered
●
Introduction to dynamic routing protocols
●
Types of dynamic routing protocols
●
Dynamic routing protocol metrics
●
Administrative distance
QUIZ
+
Quiz 1
R1 learns four routes to [Link]/24 through multiple routing protocols: RIP, EIGRP,
OSPF, and IS-IS. Which route/routes will be added to the route table?
a) RIP route only
b) EIGRP route only
c) OSPF route only
d) IS-IS route only
e) RIP and EIGRP routes, because both are distance vector protocols.
f) OSPF and IS-IS routes, because both are link state protocols.
g) All four routes will be added.
Quiz 2
Which type of routing protocol is also known as ‘routing by rumor’?
a) Link state protocols
b) Path vector protocols
c) Distance vector protocols
d) Interior gateway protocols
Quiz 3
R1 learns two routes to [Link]/16 via RIP, one via [Link] and the other via [Link].
Both routes are 5 hops away. Which route/routes will be entered into the routing table?
a) Both routes
b) Only the route via [Link]
c) Only the route via [Link]
d) Neither route will be added because RIP’s AD value is too high.
Supplementary Materials
●
Review flash cards
(link in the description)
●
Packet Tracer lab
JCNP-Level Channel Members
*as of June 13th, 2020