Enhanced Interior Gateway Routing
Video Activity
Enhanced Interior Gateway Routing In this lesson we introduce you to Enhanced Interior Gateway Routing, a proprietary Cisco protocol. We discuss what is met by advanced distance vector routing protocol and explain the concepts of non-periodic, partial and bounded. You'll learn the difference between the routing table update and synchronization proc...
Join over 3 million cybersecurity professionals advancing their career
Sign up with
Required fields are marked with an *
or
Already have an account? Sign In »
Time
27 hours 46 minutes
Difficulty
Intermediate
CEU/CPE
31
Video Description
Enhanced Interior Gateway Routing In this lesson we introduce you to Enhanced Interior Gateway Routing, a proprietary Cisco protocol. We discuss what is met by advanced distance vector routing protocol and explain the concepts of non-periodic, partial and bounded. You'll learn the difference between the routing table update and synchronization process and time tables and why EIGRP is even driven rather than time driven. You'll also learn about "hello" packets and what it purpose is and why, and what a hold time is.
Video Transcription
00:04
the next topic of discussion is the Cisco Proprietary Protocol
00:08
enhanced interior Gateway Routing protocol R E i G R P For short
00:14
now E i. G R P is an advanced distance vector routing protocol.
00:20
Some books,
00:22
especially the older ones. If you read them, it will say that the a G R P. Is a hybrid protocol, insinuating that it's partly dis inspector and partly Link state. That is absolutely incorrect.
00:34
So that might have been a marketing ploy by Cisco to say that. Okay, you get the best of both worlds. But that is not the case. Yes, J. R. P is a distance vector routing protocol. However you can say that yes, it is an advanced distance vector routing protocol.
00:52
Why is it in advance this in vector routing protocol? Because E I G R P updates are non patriotic, partial and bounded.
01:00
So what do I mean by non periodic well
01:03
with route information? Total call. The routing update, which was the whole routing table, will sense every 30 seconds.
01:11
Yeah, J. R P does not send its updates every 30 seconds or every set Interval e J R B only sends an update when something in the topology changes, a new writer link comes up or a rattling goes down.
01:23
That's the only time and update descent.
01:26
The next word I use was the updates, uh, partial, which means the contents of the whole routing table is not sent to my directly connected devices.
01:37
On Lee, the change in the network is sent,
01:40
not the whole routing table. So if a link goes down, I let my neighboring rather know that this this link went down. I won't send the whole routing table over because that's not needed.
01:51
Next, I said, the updates are bounded. Bounded means the updates are sent on Lee to neighboring devices that need them not to everybody, which makes it more efficient. Hence, it is an advanced this inspector routing protocol.
02:06
Yeah, Jarvi updates are sent to the multi cast address to 24 00 10
02:13
now since abates a non periodic. You don't know if your neighboring router went down at some point. So to counter that, yes, you are the uses little packets called hello packets to keep the link alive and to discover directly connected devices. So if I receive e g r P, hello
02:31
forma directly connected device. I know that device is alive
02:36
and I can discover that it's actually there. I have a neighbor that also speaks E g R P.
02:40
Now within the
02:43
hello packet
02:46
is held the whole time
02:49
for the neighbor. When I send a hello packet to Annie I g r P neighbor within it, I will set the whole time.
02:55
The whole time is the number of seconds. My neighbor is supposed to wait for me to send another helo or update packet before considering me down.
03:06
The whole time is usually set to three times the hollow interval
03:12
by default. The whole time it's set. Do three times the hello interval.
03:16
So for links speeds greater than t one speeds with it which is 1544 kilobits per second. A lose are sent every five seconds.
03:28
So the whole time for links speed that is greater than three t one speeds. The whole time will be 15 seconds. Three times the hello interval
03:38
fooling speech less than t one speech or less than 1544 kilobits per second.
03:45
The hello timer is set to 30 seconds so my whole time is
03:51
three times three is 9 90 seconds on my hello time would be 30 seconds
03:57
moving on.
03:59
He has your P stores, all routes to all destinations in a table called the topology table. So all routes stored
04:06
are stored in the topology table, even if multiple routes to the same destination. In case I have multiple links to the same destination President, even multiple routes to the same destination are stored in the topology table.
04:20
Now these routes, as they sit in the topology table, are called feasible successor routes.
04:27
One point backing up for a minute is all these routes are stored in the topology table and the topology table exchange occurs after I have discovered my neighbors threw the hello message. So when I send my neighboring router Ah, hello and I receive Ah, hello. Back from my neighboring router.
04:44
I will go ahead and exchange the contents off my topology table
04:46
with my neighboring router so that he learns all the routes to or that it learns all the routes to
04:54
Now, as these routes sit in the topology table, they're called feasible successor routes.
05:00
So these route, as they're reciting the topology table, they're called feasible successor routes.
05:05
Each one of these routes has an associate ID metric, and the metric for E. I. G R P is called the feasible distance.
05:15
I will go into more. About what? How the metric for years, every works in about five minutes. But the metrics for AARP is called feasible Distance.
05:25
Now
05:25
I said that all the routes to all the destination, even multiple routes to the same destination are stored in the topology table.
05:33
The best one of these routes. The best one off each of these routes is plucked from the topology table and implanted in the I P routing table or you're out information base. And then it is called the successor route.
05:47
So which is the best route
05:49
off all the routes in the topology table, while the best routes will be the one with the Louis Metric or the Louis feasible distance, So the route with the Louis feasible distance is plucked from the topology table and implanted in the route information base or your routing table,
06:06
and then it can be used
06:09
now. E. A G. R P also has a concept called reported distance.
06:15
Now be advised that if you're reading a book on me as your piece. Some of the older books called this the advertised distance. The newer book Now books have now started calling it the reported distance. Now what is the reported distance?
06:29
The reported distance.
06:30
If
06:31
the feasible distance for your upstream router
06:35
and what does that mean?
06:36
Well, let's look at this topology router. One is connected to a router to, and rather too, is connected to a router. Three. Network 10 at the very end is available to router to and router one through router tree,
06:51
so
06:51
router to is a feasible distance off 50 away from Network 10 or from router three.
07:00
So that is router two's feasible distance Now router to reports a distance off 52 router one.
07:08
So Router one will see a reported distance off 50 because router to is reporting its own distance, the router one as being 50
07:17
router. One will take that 50 and daughter one knows that its own distance from itself to router to is 100 it will add the 50 to 100 to get a total feasible distance off 1 50
07:30
So once again, a reporter distance is the distance and upstream or closer to the network that you were trying to get to an ops team. Router reports to you. So the feasible distance of the upstream router. As reported to you
07:48
now the next concept in yeah g r p I'm gonna cover is the feasibility condition.
07:54
The feasibility condition say's that a route reported distance must be less than the routes
08:03
feasible distance for it to be eligible to be installed in the topology table. So a route reported distance must be less than the routes.
08:13
Feasible distance for the route to be reported to be installed in the topology table. Let's see how this works.
08:20
We have three routes
08:22
between Router four and Router five. Let's create Network 10 over here, So Router four has passed a, B and C to choose out of to go from Router four to Network 10.
08:33
True Router five.
08:35
So path is to router. One path be is to router to and patsies to router three.
08:41
So let's calculate the feasible distance off this route.
08:46
The Top Path
08:48
Router one is reporting a distance or sending a reporter distance off. 32 out of four and the distance from writer for
08:56
to router one is 50. So the total distance for Path A is 80
09:03
router to is reporting a distance of 92 out of four,
09:09
and Router four has a distance of 10 from itself to router to for a total distance of 100.
09:16
For past be
09:18
Router three is reporting a distance off 72 Router four
09:24
and router fours. Distance from itself to rather three is 40
09:28
for a total distance off
09:31
1 10
09:33
So Path A becomes your successor out with a feasible distance,
09:41
an F B off 80 will pass. Be even make it to the topology table. Well,
09:48
my feasible distance is 80
09:50
and the feasibility condition states that my reported distance must be less than my feasible distance for the route to be installed in the topology table. Over here, Router to is reporting a distance off 90
10:05
two out of four, which is higher than my feasible distance.
10:09
So path be won't even be considered for installation in the apology table. Why is that Well, in effect, router to is telling router for that I'm further away from you
10:24
to get two out of five so router to is telling router. For that, I'm even further from router five than you are
10:33
because it is reporting a distance of 90 basically telling router for actually, I'm further away from your destination than you are.
10:41
So if Router four tries to route to router to and if you pick router to up and make it, put it further away from now or four. Rather four might send information to route her true and then have to pass back through itself.
10:54
Do you get to Network 10
10:56
which would cause a rounding loop So the feasibility condition is a new prevention mechanism,
11:01
So on the diagram, it might look like this, but in effect, router to is actually further away from Network 10. Then router, for
11:09
this could show up as a test question.
11:11
Now let's look at the last route,
11:15
even though the total distance
11:18
is more
11:18
then path be. Patsy's total distance has won 10 pat bees. Total distance is 100 but the reported distance
11:28
that Router three is reporting
11:30
to router 4 70 which is less than your feasible distance. So patsy goes into the topology table and it is your feasible successor out
11:39
now. If the successor out fails, which is Path E. The next best feasible successor, which is Patsy, immediately becomes the successor,
11:50
which helps with convergence because you already have alternate paths to the same destination stored in your apology table. So if the best path fails, you immediately promote the next best path to the routing table.
12:05
This concludes the feasibility condition lecture.
Up Next
Instructed By
Similar Content
