Time
15 hours 34 minutes
Difficulty
Intermediate
CEU/CPE
20

Video Description

Open Shortest Path First For our next lesson, we introduce you to Open Shortest Path First routing protocol. We'll examine the differences between OSPF and EIGRP, as well as the differences between a link state protocol (OSPF) and a distance vector routing. For example, you'll learn that routing updates are not sent in OSPF and why, and what its function is and what a Link State Advertisement is. You'll learn what routers flood LSA information, how the LSA information builds a link state database and what how the SPF algorithm independently calculates its own routes to remote destinations.

Video Transcription

00:04
The next topic of discussion
00:07
is open shortest path first, which is a routing protocol.
00:11
Now, U. S P F is not a distance vector routing protocol. Oh, SPF is our first and only link state routing protocol covered in the C c a.
00:23
Now,
00:25
with numerous VF,
00:27
you don't send routing updates every set, interval or when the topology changes. Routing updates are not sense, like their scent in the i g. R p and rip.
00:39
So what does it SPF do? Well,
00:42
each router in new SPF upon startup or upon initialization when you start the SP of process describes itself
00:51
in packets
00:53
called Link State advertisements.
00:57
Okay,
00:58
Now an L s a r a link state advertisement within it contains the routers links, which means the routers, interfaces and the i p networks attached on those links.
01:10
So a routers link, for example, serial 000 on router to Owen and the I P network attached to it, which is 202 102 100 zeros. Last 30.
01:21
The neighboring routers, so router to one would also describe router one inside off its L S A.
01:27
And the metric to get to those neighbors. So the metric to get from Router two A 12 router one.
01:34
Then each router floods these l essays to outlet apology. So l s a flooding done by every router. So each router takes this l s a bills analysis, puts this information in it
01:49
and then floods it to everybody else
01:53
At the end of the flooding process.
01:56
Each router has an L s A from every other router,
02:00
and it builds a database. Of all these Ellis is called the Link State did of it so identical links their database built on every router.
02:09
The link state database on every router looks exactly like the link state database on every other router.
02:17
After the link State database has been built, the shortest path first algorithm is run over
02:25
the links, their database and each route. Each router independently calculates routes to remote destinations
02:34
and puts them in their routing table or puts them in the rib
02:38
or out information base. Now you see the difference here between E. I. G. R p and rip
02:45
which route by rumor which basically believe information that the next upstream router is sending them instead of that happening. Oh, SPF independently calculates its own route to every destination with that
03:00
doing the routing by rumor approach without getting its routes or its information from somebody else. It automatically independently calculates routes to remote destinations and puts them in the rib. When tourists, we have routers first come up when you first type in the commands and
03:17
you bring up the SPF on
03:20
one rather and then on another router. The first thing they do is send each other all the l essays, and they synchronize their databases with each other.
03:30
Once this database synchronization has happened, these routers are set to be adjacent with each other or an adjacency has formed or their neighbors with each other.
03:43
These neighbors are then stored in the neighbor table.
03:46
So, as we will see, we will execute a command show I p o S p f neighbor, and we will see all our neighbors in the neighbor table just like it happened with E i g r p.
03:57
Now these neighbors are kept alive through the hello message.
04:01
Okay, just like with the I g r p, the link is kept alive through the sending off fellows.
04:06
The hollow message inside off It contains the dead timer.
04:13
So the dead timer is amount of time. I'm going to wait for a neighboring router to send me a hello before considering it down.
04:21
The debt timer is usually set to four times or the dead timer by default is set to four times the hello timer.
04:30
So what is the low timer? I lose a cent every 10 seconds over monthly access networks like Ethernet
04:36
or or broadcast multi access networks like Ethernet and Hollows ascent every 30 seconds over non broadcast multi access networks like train relit,
04:48
friend, relatable cover towards the end of the class.
04:53
Next,
04:54
hellos are sent true. The multi cast address to 24 005 Certain fields in the hello packet must match for two routers to become neighbors. The first field that must match is the I. P. Sub net and the sub net mask off that interface that is talking to the other side
05:14
or talking to the neighboring router.
05:15
Authentication information also must match for the adjacency to form
05:21
to form between two SPF neighbors. So if you're using some kind of authentication both authentication,
05:29
both sides must have the same type of what indication on both sides must have the same with indicating passwords.
05:35
The hollow and dead timers must also match in the low packets for the adjacency to form.
05:41
Also, something called the Area I D. And I will get into that in a little bit. Must match for two routers to become Oh, SPF neighbors
05:48
moving on.
05:50
Each router picks for itself. Out of all the available I P addresses on the router. Something called a router i d. The router idea is nothing more than an identify her for the router itself.
06:03
So in descending order, the router will prefer the router i d. If it is configured with the router I d command
06:11
next, the router I d will pick the highest. If the router I d command is not done, then the router will pick the highest configure new back I p.
06:23
And if no Lou backs of president than the highest physical interface address.
06:28
So
06:29
my question is,
06:30
let's say you have new back.
06:34
Look back
06:36
1000
06:40
with an I P address of 1.1, not 1.1 slash 32 you will see later on that Lou back into faces can actually have a slash 30 to mask, which is all to five fives
06:55
and then I have new back. I'll just a loop
07:00
1 51 51 51 50
07:08
slashed 32
07:09
Between the two of these,
07:11
let's say this is Lou back 50
07:14
between the two of these, which one will become the routers? Router I d. If the router I d command has not been executed
07:21
automatically 1 51 51 51 50 will become the router I d. So it doesn't matter what the loop back interface ideas. It matters with the I P addresses.
07:32
Okay, so this type of question might be on the exam. Don't get it wrong.
07:38
So your monthly access networks
07:40
If every router became neighbors with every other router,
07:45
you would end up with a lot of magician sees how many specifically to
07:49
into n minus one neighbor relationships.
07:55
How do I get that? Well, let's see if I have full routers and these dots represent routers
08:01
and every router formed a neighbor relationship or in adjacency with every other router,
08:05
you would have
08:09
123456 adjacent seas or true into N, is the number of routers, which is four minus one
08:18
to into three, equals six adjacent seas.
08:22
So as the number off routers go up, Jason sees go up, and this is just way too much overhead.
08:30
So what happens in a multi access network is multi Axis networks. Elect a router, call the D R or a designated router
08:39
and a backup designated router, which, as the name says, is simply a backup for the D. R. If the D R fails and every router becomes adjacent with Onley, the D r and B D r.
08:52
Okay, and every router becomes adjacent with adjacent with only the D. R and the BDR. Now, as you will see in most networks, we don't even allow v d our election or backup designated router election. We just elect one designated router and everybody becomes adjacent with that one router. So this picture would look
09:15
like
09:18
this
09:20
with this guy being the D R.
09:22
Only three adjacent seas instead off six.
09:26
Now, how is a designated router elected? Well, a designated router is elected according to something called the SPF router priority.
09:35
By default, all routers have a priority off. One
09:41
priority values can range between zero and 255
09:46
So the higher the priority, the better. So the highest priority router becomes the D R.
09:52
Priority zero routers do not participate in designated router and backup designated router election.
10:00
So now if everybody's priority is won by default, what's the tiebreaker? Well, the router with the highest router I d becomes the d. R.
10:09
However, having said that, it doesn't really work out that way in a real network because you're not going to configure your routers all at the same time. You're one person.
10:20
So the router you configure first Alexe itself as the d R. And then you have to go change it around.
10:26
Lastly,
10:31
D are other routers,
10:33
so D are other routers are the routers, as the name implies are not the designated router or the backup designated router.
10:41
So D are other outer sender l essays in a big packet
10:46
through the multi cast address. True, 24 006 actually
10:54
to 24 006
10:56
and the only one listening in on this address. The only routers listening in on this address are the designated router and the backup designated router,
11:05
and then the designated router and the back of designated router are initially just a designated router reflects these essays back to everybody else. Over to 24 005

Up Next

Cisco CCNA

Our free, online, self-paced CCNA training teaches students to install, configure, troubleshoot and operate LAN, WAN and dial access services for medium-sized networks. You'll also learn how to describe the operation of data networks.

Instructed By

Instructor Profile Image
Junaid Memon
Instructor