All language subtitles for Free-CCNA-Dynamic-Routing-Day-24-CCNA-200-301-Complete-Course_en

Welcome to Jeremy’s IT Lab. This is a free,\n

these videos, please subscribe to follow along\n

a comment, and share the video to help spread\n

In this video we will return to Layer 3, after\n

VLANs, DTP, VTP, Spanning Tree, and EtherChannel. This\n

routing. ‘Dynamic routing’ is in contrast\n

in Day 11 of this course. Static routing involves\n

with the ‘IP ROUTE’ command. Dynamic routing,\n

dynamic routing protocol on the router, and\n

the best routes to destination networks. It’s\n

If you add a new LAN, routers will automatically\n

new destination network. If one path to a\n

will automatically start using the next-best\n

to cover a large portion of the exam topics\n

of the CCNA exam, and we’re going to cover\n

later. We’ve already covered some of the\n

parts of 3.1, 3.2, and 3.3. My plan is to\n

give a general overview of dynamic routing\n

of two routing protocols, RIP and EIGRP, in\n

days to cover OSPF, which is actually the\n

the exam topics list, in 3.4. However, even\n

still need a basic understanding of other\n

able to compare and contrast them to OSPF.

Here’s what we’ll cover in today’s video.\n

routing protocols, to demonstrate how they\n

over static routes. There are a few types\n

them down. We will then take a brief look\n

‘metric’ is how it measure how ‘far’\n

spanning tree protocol, and it’s used to\n

Finally, we’ll talk about something called\n

part of determining the best route to a destination.\n

for a bonus question from Boson ExSim for\n

and the ones I used when I studied for my\n

follow the link in the description.

Here is the network topology I’ll use for\n

routers, R1, R2, R3, and R4, and there is\n

be focusing mostly on R1’s perspective for\n

or dynamic routing protocol, R1’s routing\n

local routes which were automatically added\n

Let me take a minute to clarify a few points\n

here, 10.0.12.0/30 and 10.0.13.0/30, are examples\n

a route to a network or subnet. In other words,\n

For example, if we configure a static route\n

also. It’s not a route to a single host,\n

10.0.12.1/32 and 10.0.13.1/32, are examples\n

a specific host, a single address, specified\n

automatically added, and are host routes to the\n

and G1/0 interfaces. To configure a static\n

the host’s address, then 255.255.255.255,\n

aside, so you understand those two terms.\n

Instead of configuring static routes on each\n

routing protocol on them. Then, R4 will ‘advertise’\n

R2, saying ‘you can reach this network via\n

It will then advertise the same thing to R1,\n

via R2. R1 will add this route to its route\n

you can see that R2 also advertised the 10.0.24.0/30\n

added it to its route table. R1 will then\n

can reach 192.168.4.0/24 via R1. It will also\n

learned from R2, as well as the 10.0.12.0/30\n

focusing on the one network for now.

How about if there is an error and R4’s\n

will automatically adapt and remove the route\n

has removed the route. This will prevent R1\n

What if the same situation happened when using\n

on R1. It can send traffic to R4’s network\n

failure on the link occurs? Because there\n

is unaware that it can no longer reach the\n

destined for that network, it will continue\n

no longer reach the network. Okay, so that’s\n

remove invalid routes. However, we really\n

so instead of totally removing the destination\n

So, I’ve added another connection between\n

internal network. via R2, and via R3. Let’s\n

has the route via R2 in its route table, as\n

will happen if I disable R4’s G0/0 interface\n

So, I did that, and now let’s check R1’s\n

R2 was now automatically replaced with the\n

lost the preferred route to 192.168.4.0, but\n

may be wondering, why the route via R2 was\n

because this connection here is a fastethernet\n

already familiar with the spanning-tree concept\n

the best path to the root bridge. Well, dynamic\n

determine the best path to a destination.\n

from both R2 and R3, however it determined\n

Okay, so that’s a very quick introduction\n

purpose. Here are a few key points. Routers\n

information about their connected routes as\n

devices. They form ‘adjacencies’ , also\n

with adjacent routers to exchange this information.\n

adjacencies with R2 and R3, its directly\n

a destination are learned, the router determines\n

routing table. It uses the ‘metric’ of\n

the lower metric is superior. Just like in\n

when determining the root port on a switch.\n

Now lets talk about the different types of\n

protocols can be divided into two main categories,\n

and EGP, which stands for Exterior Gateway\n

to share routes within a single autonomous\n

for example a company. EGPs are used to share\n

Maybe this diagram will make it easier to\n

ISP B are each their own autonomous system,\n

to exchange routing information. However,\n

an EGP is used. The basic purpose of IGPs\n

about routes to destinations. However they\n

course, we will focus mostly on OSPF, which\n

other IGPs and the one EGP that is in use\n

Now let’s break down these categories further.\n

Interior Gateway Protocols, IGPs, and Exterior\n

further break these categories down by the\n

used by each protocol to share route information\n

There is only one type of EGP algorithm, Path\n

EGP algorithm, but there is only one EGP that\n

Border Gateway Protocol. Because it’s not\n

about BGP. I will mention a few important\n

need to know BGP for the CCNA. Just make sure\n

share route information between autonomous\n

that is used in modern networks. So, you also\n

‘Path Vector’ algorithm functions. Now,\n

and link state. I’ll repeat, when I say\n

protocol uses to share route information and\n

All routing protocols have the same goal.\n

and select the best route to each destination.\n

for each routing protocol. There are two distance\n

Protocol, and EIGRP, Enhanced Interior Gateway\n

protocols in depth, although I will give you\n

compare and contrast them with OSPF. So, RIP\n

There are also two link state protocols. OSPF,\n

System to Intermediate System. Like BGP, I\n

to learn more about IS-IS, consider looking\n

the CCNA. OSPF, however, I will spend plenty\n

For now, what I want you to remember is, first\n

protocols. Then remember which protocols use\n

a distance vector algorithm, OSPF and IS-IS\n

path vector algorithm. The flashcards I provide\n

want to outline the characteristics of distance\n

I’ll start with distance vector routing\n

protocols we will learn about are RIP and\n

before link state protocols, in the early\n

are RIP and Cisco’s proprietary protocol\n

Distance vector protocols operate by sending\n

connected neighbors. their known destination\n

known destination networks. This method of\n

‘routing by rumor’. Why the name? It’s\n

network beyond its neighbors. It only knows\n

This is different than link state routing\n

more complete picture of the network. When\n

hand, all the router knows is the routes its\n

to reach those destinations. The reason for\n

the routers only learn the ‘distance’,\n

which is the direction to send the traffic, the\n

distance vector protocols work by sharing\n

So, the example I showed you before of R4\n

example of distance vector logic. R4 tells\n

can reach 192.168.4.0/24 via me. My metric\n

metric numbers yet, each routing protocol\n

cover those soon. Anyway, R2 doesn’t know\n

via R4, and that R4’s metric is 1. Similarly,\n

the metric as 2. Once again, R1 doesn’t\n

it knows is that it can reach 192.168.4.0/24\n

is 2. And of course, R1 advertises the network\n

network. Once again, RIP and EIGRP are the\n

are used, and we will talk more about them\nin day 25’s video.

Next I’ll briefly introduce link state routing\n

protocol, every router creates a ‘connectivity\n

same on each router. To allow this, each router\n

its connected networks, to its neighbors.\n

routers, until all routers in the network\n

each router independently uses this map to\n

I think you can see how this is different\n

vector protocols. In link state protocols,\n

so that it can calculate the best routes.\n

CPU power and memory, on the router, because\n

state protocols tend to be faster in reacting\n

protocols. The two link state protocols in\n

mention some things about IS-IS, but as for\n

Now let’s talk about those metrics that\n

table contains the best route to each destination\n

a dynamic routing protocol learns two different\n

determine which is ‘best’? As I briefly\n

of the routes to determine which is best.\n

like the root cost in spanning tree. A lower\n

with the lowest root cost will become the\n

the route with the lowest metric is considered\n

table. Each routing protocol uses a different\n

Here in this slide I showed you before, although\n

via R2 and one via R3, only the route via\n

connection here has a higher metric cost than\n

this route is less favorable. Now, you might\n

ethernet connection? Both routes would have\n

to the route table? Let’s see what happens.

I changed the connection between R3 and R4\n

others. Let’s check out R1’s route table.\n

via 10.0.13.2, which is R3, and via 10.0.12.2,\n

more) routes via the same routing protocol\n

both will be added to the routing table. Traffic\n

that they must be exactly the same destination,\n

Here’s a larger view. In this case both\n

protocol OSPF, as indicated by the code O\n

same destination, 192.168.4.0/24, and they\n

itself is also displayed in this output. Where\n

square brackets is the metric value of the\n

both were added, and traffic will be load-balanced\n

MultiPath, or ECMP, load-balancing. Make sure\n

up often in these videos about dynamic routing\n

side of the square brackets, this is another\n

or AD, which I will talk about a few slides\n

Don’t memorize that now, as I said I’ll\n

Since I just showed you ECMP, equal cost multipath\n

I just want to let you know that you can do\n

OSPF on R1, and then configured two static\n

via R3. Then, both are added to the routing\n

both routes. Notice that both routes have\n

use the concept of ‘metric’ so you’ll\n

distance, AD, value of static routes is 1.\n

a few slides. For now, let’s return back\nto the topic of metric.

As I already mentioned, each routing protocol\n

of these in more detail in later videos, but\n

RIP uses by far the simplest metric, hop count.\n

counts as one ‘hop’, and the total metric\n

One big downside is that links of all speeds\n

megabit per second ethernet link is one hop,\n

So, this is a very primitive way of calculating\n

the most complicated metric of the IGPs, which\n

by default, however with configuration other\n

to note is that only the bandwidth of the\n

the metric, but the total delay values of\n

value is a little misleading, since by default\n

on its bandwidth. Anyway, I’ll talk more\n

more depth on EIGRP. Next up is OSPF, its\n

link is calculated based on the bandwidth,\n

route make up the metric of the route. This\n

but also clearly better than RIP’s which\n

IS-IS also uses a metric called ‘cost’.\n

calculated based on bandwidth. All links have\n

it functions the same as RIP, being a simple\n

talk about much, but these other three I will\n

now just remember the basics. RIP uses hop\n

and delay, and OSPF uses a cost based on bandwidth.\n

same, to let the router select the best route\n

To briefly demonstrate how the difference\n

selects, let’s look at this diagram again\n

to 192.168.4.0/24 to select for its route\n

Via R2, the hop count is 2. One hop to R2,\n

2. One hop to R3, one hop to R4, even though\n

fastethernet connection. So, both routes will\n

load balance traffic using both routes, even\n

is used instead of RIP, which path will be\n

take into account bandwidth. So, the slower\n

a higher metric value, making it less favorable.\n

route table, and R1 will send all traffic\n

R2. RIP views both routes as equal, but OSPF\n

metrics is the same, to let the router select\n

routing protocols might make better decisions\nthan others.

Now let’s talk about administrative distance,\n

cases a company will only use a single IGP\n

EIGRP if they only use Cisco equipment. However,\n

example, if two companies connect their networks\n

protocols might be in use. You might connect\n

EIGRP. Metric, which I just showed you, is\n

routing protocol. If a router learns two routes\n

metric to choose which route is better. However,\n

metrics, so they cannot be compared. For example,\n

a metric of 30, while an EIGRP route to the\n

Which route is better? Which route should\n

really answer those questions by looking at\n

different metrics. So, the administrative\n

routing protocol is preferred. A lower AD\n

protocol is considered more ‘trustworthy’,\n

As you saw before, RIP’s hop count-based\n

a high AD, because it’s not as trustworthy.\n

they have the same hop count, although really\n

Ready for some memorization? These are the\n

of routes. I HIGHLY recommend you use the\n

if you don’t get a question on the exam\n

are learned, one from OSPF and one from EIGRP.\n

To answer that question, you would need to\n

route is preferred and will be entered in\n

is preferred, and will be selected over a\n

values used on Cisco devices, other vendors\n

preferred routes are those to directly connected\n

are the next best, they have an AD of 1. Next\n

with an AD of 20. There is another kind of\n

later. EIGRP routes have an AD of 90. Next\n

an AD of 100. OSPF has an AD of 110. IS-IS\n

So, of the IGPs I showed you, which are RIP,\n

preferred, it has the lowest AD. However,\n

These are beyond the scope of the CCNA, but\n

the EIGRP network, that are then advertised\n

AD of 200. Then one more. Routes with an AD\n

Cisco. If the administrative distance is 255,\n

that route and does not install the route\n

these. If you’re not using the flashcards,\n

this. Without flashcards it might be difficult\n

Here’s a quick quiz question to demonstrate\n

network 10.1.1.0/24 are learned. A route with\n

with a metric of 5. A route with a next hop\n

of 3. And a route with a next hop of 192.168.3.1,\n

route to 10.1.1.0/24 will be added to the\n

the answer. Okay, so the answer is the OSPF\n

is used to compare routes learned from the\n

metrics, AD is used to select the best route.\n

over the RIP routes, because it has a lower\nAD.

Looking back at the route table I showed you\n

static routes. The connected and local routes\n

And another look at this route table with\n

Remember that the number on the left inside\n

One final point before moving on to the quiz.\n

and I will demonstrate this when we cover\n

want OSPF routes to be preferred over EIGRP\n

that. You can also change the AD of a static\n

to configure a static route. IP ROUTE, followed\n

the next hop address. However, I used the\n

Here it says ‘distance metric’ for this\n

but don’t confuse this for the metric we\n

So, I configured the route with an AD of 100.\n

can see that the AD is now 100, instead of\n

why would you want to do this?

By changing the AD of a static route, you\n

by a dynamic routing protocol to the same\n

the static route’s AD is higher than the\n

route will still be preferred. This kind of\n

route’. The route will be inactive, meaning\n

the route learned by the dynamic routing protocol\n

router stops advertising it for some reason,\n

with a neighbor to be lost. You can see here\n

exam topics list. Make sure to watch the lab\n

to get practice configuring everything we\ncover.

Okay, so let’s quickly review what we covered\n

to dynamic routing protocols. They allow routers\n

destinations without having to manually configure\n

in large networks it’s not practical to\n

configure thousands of different routes, which\n

types of dynamic routing protocols. First,\n

gateway protocols, used for routing within\n

gateway protocols, used for routing between\n

The only EGP in use these days is BGP. We\n

kind of algorithm they use. There is one type\n

there are two different kinds of IGP algorithms.\n

link state, used by OSPF and IS-IS. Then we\n

uses a different metric, which is a value\n

within the same routing protocol. However,\n

With administrative distance. Use the flashcards\n

routing protocol, I’m sure you’ll need\n

in this video, so I want to say that you shouldn’t\n

completely yet. In the next video I will cover\n

videos after that will cover OSPF. In those\n

topics again, such as administrative distance\nand metric.

Okay let’s move on to today’s quiz. At\n

question from Boson ExSim, the best practice\n

for the CCNA exam and you want to make sure\n

my opinion, the single best thing you can\n

Follow the link in the description to get\nBoson ExSIm.

Here’s quiz question 1. R1 learns four routes\n

protocols: RIP, EIGRP, OSPF, and IS-IS. Which\n

A, the RIP route only. B, the EIGRP route\n

route only. E, the RIP and EIGRP routes, because\n

and IS-IS, because both are link state protocols.\n

table. Pause the video to think about your\nanswer.

The answer is B, only the EIGRP route will be added to the routing

destination to add to the routing table, and\n

the AD is used to determine which will be\n

lowest AD of the four protocols, so only the\n

Which type of routing protocol is also known\n

B, path vector. C, distance vector. Or D,\n

The answer is C, distance\n

RIP and EIGRP operate by telling neighboring\n

metrics to reach those networks, this is known\n

because, when using a link state protocol\n

a complete map of the network to calculate\n

minimal information a router receives from\n

B, path vector, is a type of EGP, exterior\n

current CCNA, and operates differently than\n

or IGP, is a category which includes both\n

so it is incorrect. Let’s go to question\n3.

R1 learns two routes to 172.16.0.0/16 via\n

Both routes are 5 hops away. Which route/routes\n

both routes. B, only the route via 10.0.0.1.\n

route will be added because RIP’s AD value\n

The answer is A, both routes\n

are to the same destination, 172.16.0.0/16.\n

RIP. And they have the same metric, 5. So,\n

added to the routing table and R1 will load-balance\n

D, if R1 also learned a route to 172.16.0.0/16\n

this would be true, because RIP’s AD value\n

However, there was no mention of another routing\n

take a look at a bonus question from Boson\nExSim for CCNA.

Okay, for today's Boson ExSim practice question\n

it's a good question about route selection.\n

IP ROUTE command on RouterA and receive the\n

four routes, S R D O. S is a static route,\n

That's right, its D, not E. And O is OSPF.\n

All of them begin '10.20.0.0', but they have\n

as different destinations. The static route\n

same destination. So that's why, even though\n

most preferred, all of the routes appear in\n

So, RouterA receives a packet that is destined\n

will RouterA use to send the packet? Select\n

it has the highest administrative distance.\n

with the longest prefix match. C, the static\n

over dynamic routes. Or D, the EIGRP route\n

Okay, pause the video here to think about\n

So, in today's video I just talked about metric\n

routes from multiple routing protocols to\n

distance to select the route. But if you get\n

you use the metric. However, these routes\n

different destinations, as I just said, because\n

AD and metric numbers are irrelevant. So,\n

11's video about static routes? How does the\n

destination matches multiple entries in the\n

all of these entries, so it could use any\n

most specific match. And 'most specific' means\n

should use this OSPF route and send the packet\n

So, I think B, 'the OSPF route because it\n

is the correct answer. Let's check. And it\n

explanation, here is Boson's explanation.\n

is the great thing about Boson ExSim, is it\n

why B is correct, but also why A, C, and D\n

to some Cisco documentation, which is freely\n

in Cisco routers'. Okay, so that was today's\n

to get a copy of ExSim, please follow the\n

exams I used when I studied for my CCNA and\n

me pass all of my exams on the first try.\n

ExSim, please follow the link in the video\ndescription.

There are supplementary materials for this\n

the software ‘Anki’. There will also be\n

some hands-on practice. That will be in the\n

the link in the description, and I’ll send\n

Before finishing today’s video I want to\n

you to John, funnydart, Joshua, Scott, Aleksa,\n

Samil, Velvijaykum, C Mohd, Johan, Mark, Miguel,\n

of ExSim, Sidi, Magrathea, Devin, Charlsetta,\n

Sorry if I pronounced your name incorrectly,\n

of you is still displaying as Channel failed\n

and I’ll see if YouTube can fix it. This\n

of recording by the way, June 13th 2020, if\n

on here don’t worry, you’ll be in future\nvideos.

Thank you for watching. Please subscribe to\n

and share the video with anyone else studying\n

check the links in the description. I'm also\n

or Basic Attention Token, tips via the Brave\n