1
00:00:01,050 --> 00:00:04,550
In the section we're going to talk about dynamic writing.

2
00:00:04,800 --> 00:00:13,620
And let's start with the dynamic writing protocols stick rubbing elbows writing tables in specific words

3
00:00:13,780 --> 00:00:21,430
to be set up by the network administrator dynamic wording use writing protocols that dynamically discovered

4
00:00:21,430 --> 00:00:28,900
network destinations and how to get them dynamic writing allows writing tables in rudders to change

5
00:00:28,930 --> 00:00:37,180
if rather on the rug goes down or if a network is added in dynamic running routing protocols running

6
00:00:37,180 --> 00:00:46,180
in routers continuously exchange network status updates between each other as broadcast or multicast

7
00:00:46,510 --> 00:00:53,140
with the help of Rawling update message sent by the routing protocols rather than continuously update

8
00:00:53,140 --> 00:00:54,160
the writing table.

9
00:00:54,340 --> 00:01:02,560
When the error or topology change happens and Nesco here is the good the worse is guys static routing

10
00:01:02,560 --> 00:01:13,120
words the dynamic writing static running is Ed Menil the configure crowding in entry and must be manually

11
00:01:13,210 --> 00:01:14,270
updated.

12
00:01:14,300 --> 00:01:25,120
If topology changes this is suitable for very small networks and requires less C.P. usage and that may

13
00:01:25,120 --> 00:01:35,410
be fun to use two or froma subnetwork Sedrick riding we can use in a subnetwork and it is easy to implement

14
00:01:35,630 --> 00:01:42,590
and we we're just wording one statement that points at destination and the subnet mask and the next

15
00:01:42,590 --> 00:01:43,280
stop.

16
00:01:43,510 --> 00:01:51,100
Let's go ahead with the dynamic routing dynamic writing uses running protocols that dynamically discone

17
00:01:51,370 --> 00:01:58,710
destinations as you now and automatically update that if topology change.

18
00:01:58,720 --> 00:02:00,470
That's the biggest advantage worth.

19
00:02:00,490 --> 00:02:08,290
Biggest advantage when you compare with the static routing and that is suitable for large networks because

20
00:02:08,290 --> 00:02:14,830
of this and where rapid convergence times for that dynamic routing.

21
00:02:14,860 --> 00:02:20,710
And we may require more C-p your let's go ahead.

22
00:02:20,740 --> 00:02:31,600
We have dynamic protocols work rather sands and Lucile's running message on its interfaces Firstly then

23
00:02:31,780 --> 00:02:41,890
rather his message with other others using the same protocol in the third stepbrother's Xchange rather

24
00:02:41,900 --> 00:02:43,730
information each other.

25
00:02:43,960 --> 00:02:52,690
And lastly if rather direct and topology change it advertises things to other riders.

26
00:02:53,380 --> 00:02:57,920
Let's go ahead with IGP and the EU piece.

27
00:02:57,970 --> 00:03:05,930
Actually guys we're two types of dynamic routing protocols and they are I yippies and the Egypt piece

28
00:03:06,420 --> 00:03:15,310
Id piece are used to exchange routes in the same autonomous systems and support small medium and the

29
00:03:15,490 --> 00:03:17,520
large scale organizations.

30
00:03:17,530 --> 00:03:20,770
But scale liberalitie is limited.

31
00:03:20,770 --> 00:03:24,760
For example this is the number 100 as you see.

32
00:03:24,970 --> 00:03:28,940
And here is the inside of the s 100.

33
00:03:29,170 --> 00:03:35,810
So in here the protocols I'm using are the eye piece.

34
00:03:35,820 --> 00:03:36,490
All right.

35
00:03:36,520 --> 00:03:47,720
Let's go ahead and I can quickly commercial network and the most commonly used IGY piece are Yager P

36
00:03:48,160 --> 00:03:53,350
OSPF and the use of rape is very limited.

37
00:03:53,380 --> 00:03:58,170
And I espies also ISIS as the IGP.

38
00:03:58,690 --> 00:04:01,570
And let's go ahead with the EDP.

39
00:04:01,840 --> 00:04:10,780
Egypt is are used to exchange routes between different autonomous systems and BGP is the only Egypt.

40
00:04:10,900 --> 00:04:19,230
Today the main function of the BJP is to Xchange a large number of fronts between different alternate

41
00:04:19,370 --> 00:04:20,230
systems.

42
00:04:20,230 --> 00:04:23,400
For example here is a has 200.

43
00:04:23,500 --> 00:04:25,830
And here is a 100.

44
00:04:26,020 --> 00:04:32,470
If you want to exchange routes between is 100 and the is 200.

45
00:04:32,490 --> 00:04:34,280
We're using Egypt.

46
00:04:34,360 --> 00:04:39,460
And the BJP is the only AJP we are using today.

47
00:04:41,280 --> 00:04:43,590
Let's go with the dynamic wording.

48
00:04:43,610 --> 00:04:53,820
Perko classes we have three classes of dynamic writing porticoes and their distance their links state

49
00:04:54,150 --> 00:04:56,590
and their pet vector.

50
00:04:56,640 --> 00:05:02,990
This is why the protocols route according to the hope count guys.

51
00:05:03,030 --> 00:05:12,720
Every brother knows as much as its neighbor tells him there is no network map on the rudders for example

52
00:05:12,720 --> 00:05:17,600
rape and IGP are the distance away of Pericles.

53
00:05:17,880 --> 00:05:24,900
Let's go to the links that routing protocols rather than running the links still writing protocols can

54
00:05:24,960 --> 00:05:29,230
extract the topology map of the entire network.

55
00:05:29,340 --> 00:05:34,740
That is they have knowledge of all the ways between two points.

56
00:05:34,740 --> 00:05:43,380
Thus they collect all the subnets in a tree and make the best decision about which way to go with the

57
00:05:43,470 --> 00:05:45,940
shortest path algorithm.

58
00:05:46,080 --> 00:05:54,390
They decide according to plan width delay and something like that and the links stay poor because our

59
00:05:54,480 --> 00:06:02,790
OSPF and the ISIS and let's go ahead with the path vectorizing porticos Rodd's.

60
00:06:02,850 --> 00:06:06,750
Information is used to determine the best.

61
00:06:06,750 --> 00:06:09,180
What's similar to this.

62
00:06:09,390 --> 00:06:18,360
This and Schwitters others do not have a network map in Pethick to riding to and the BGP is the only

63
00:06:18,360 --> 00:06:26,830
path vector running per call and here is the worse choice between this inspectors and the links there

64
00:06:26,830 --> 00:06:28,010
porticoes.

65
00:06:28,060 --> 00:06:36,250
This is way too porticos recurred that rather inform its neighbors of topology change parametrically

66
00:06:37,030 --> 00:06:39,150
and their grip.

67
00:06:39,160 --> 00:06:46,780
And yet Europeans I told Jean are pros slight lynxes poor of course have the complete left that map

68
00:06:46,780 --> 00:06:53,410
of the network topology and they choose the best path relying on their topology.

69
00:06:53,410 --> 00:06:58,400
They both and we have no neighbored dependency in here and oil spill.

70
00:06:58,450 --> 00:07:07,480
And I essay's are the links that poor of course and let's go ahead with the class full worthless class

71
00:07:07,490 --> 00:07:17,810
list part of course class food particles in Glasgow particles subnet mask is not sent in writing updates

72
00:07:18,170 --> 00:07:28,630
and we can use class A B or C and we can make class A B or C shearling by using declasse protocols and

73
00:07:28,690 --> 00:07:36,620
as we as they are classless I'm sorry as they are classful we have no CDR or real or some support and

74
00:07:36,620 --> 00:07:38,060
live version 1.

75
00:07:38,090 --> 00:07:48,860
And the GOP which is the old form the IGMP are the class food protocols classless porticos subnet mask

76
00:07:48,860 --> 00:07:54,980
is sent in writing updates and we can make classless writing.

77
00:07:55,130 --> 00:07:58,960
So we have CDR and we had some support.

78
00:07:59,000 --> 00:08:08,100
And version 2 Edgeware P ISIS and the OSPF are the classless protocols.

79
00:08:08,250 --> 00:08:12,600
Here is a general running porticos comparison chart.

80
00:08:12,740 --> 00:08:21,600
And here are the distance vector porticos rape and GOP BJP is perfect.

81
00:08:21,630 --> 00:08:31,110
But you may also see it as distance vectors in some measure the link step porticoes are ISIS and the

82
00:08:31,440 --> 00:08:39,280
OSPF as you can see the classless ones are reversion to the GOP.

83
00:08:39,330 --> 00:08:47,170
I assayers oils P.F. and e.g. peep arms are BGP and above.

84
00:08:47,220 --> 00:08:49,930
If you want to check the wheel or some support.

85
00:08:49,950 --> 00:08:58,140
As I told you in our previous life we don't have allow some support for the Persian one we can't use

86
00:08:58,140 --> 00:09:01,710
the rep in small size the.

87
00:09:02,070 --> 00:09:02,770
We can use.

88
00:09:02,790 --> 00:09:10,860
Yeah Japie ISIS in large networks and we can use BGP in very large networks.

89
00:09:10,920 --> 00:09:18,410
As Internet as well and the metric Kanda of the trip is the hop.

90
00:09:18,620 --> 00:09:21,660
Yeah jumping is a composite metric.

91
00:09:21,720 --> 00:09:32,530
I say as has the metric OSPF metric is known as cost and BGB has paired attributes at as the metric

92
00:09:32,570 --> 00:09:40,230
and we are going to take a deeper look to all of these features on our later sections.

93
00:09:40,380 --> 00:09:48,210
And if you want to check about the convergence time rip current work conquerer can come much slower.

94
00:09:48,410 --> 00:09:52,080
Yes GAAP can converge very fast.

95
00:09:52,260 --> 00:10:01,310
I say is fast and DGP is the slowest merging protocol.

96
00:10:01,520 --> 00:10:11,930
Let's go ahead with the distance Wiktor dynamic routing and rape and the rape and G or guess where others

97
00:10:11,930 --> 00:10:14,970
use the distance with the protocols.

98
00:10:14,990 --> 00:10:23,930
They send updates to their neighbor so they all know what their neighbors says and they don't know the

99
00:10:24,440 --> 00:10:33,840
details in the topology rape and yeah Arpey are the most commonly used distance waiter Porter.

100
00:10:34,070 --> 00:10:42,800
As I told you our purse slide rip is a distance vector protocol rather is that are using grip Pirko

101
00:10:43,070 --> 00:10:51,430
create the old running table based on information exchange between brothers and this for others.

102
00:10:51,620 --> 00:11:02,030
This rather sent running updates each 30 seconds to each other as broadcast for free persion one and

103
00:11:02,090 --> 00:11:13,210
as multicast as is multicast in reape version to re-appears is the Belman for the algorithm guys.

104
00:11:13,310 --> 00:11:24,350
And the actual metric of rip is the hop count Ripken's support a maximum or count of others for example

105
00:11:24,360 --> 00:11:35,640
as you can see on the screen if you want to reach from the rather 1 to 10 0 0 worth 10 0 0 0 wouldn't

106
00:11:35,690 --> 00:11:49,350
work the best path will be the path Abbo the class we will is just one more hoops to get to destination.

107
00:11:49,390 --> 00:11:58,180
But for the link below as you can't see any here we use two more hops which means two more rounders

108
00:11:58,180 --> 00:12:04,660
to get to destination and which means the worst path for the rep.

109
00:12:04,660 --> 00:12:10,850
That's why we are using this path instead of this path.

110
00:12:11,200 --> 00:12:21,120
If we are using rape as a dynamic routing protocol so let's go ahead with how we can establish a running

111
00:12:21,120 --> 00:12:23,740
table in rep.

112
00:12:23,940 --> 00:12:32,520
The first stage in the first stage all others installed they are directly connected to the running table

113
00:12:32,520 --> 00:12:39,030
as you can see rather one installs 10:41 and 10:42.

114
00:12:39,030 --> 00:12:47,550
This guy installs the forty two and three and this guy is two forty three and the forty four.

115
00:12:47,730 --> 00:12:57,210
Then in the next page results are exchanged between neighbors and the routing tables begin to grow.

116
00:12:57,210 --> 00:13:06,450
As you can see in here this guy knows this that works firstly and rather to knows about this and this

117
00:13:06,450 --> 00:13:09,360
guy knows about this one.

118
00:13:09,360 --> 00:13:16,050
Then they are starting to exchange rods with each other.

119
00:13:16,050 --> 00:13:22,370
For example rather to say is rather one that hayride around.

120
00:13:22,440 --> 00:13:36,170
I have a network which is then 14:3 and that is directly connected to me which means zero as Hop counts

121
00:13:36,730 --> 00:13:41,920
and rather one installs this to its warning table.

122
00:13:41,980 --> 00:13:51,910
As you can see the network 10 43 0 0 and the interface is the first eternal 0.

123
00:13:52,420 --> 00:14:04,420
As you can see and the hope count is one because rather two is saying that pay for delivery is directly

124
00:14:04,420 --> 00:14:11,260
connected to me rather who's up and gets this update and says that rather too.

125
00:14:11,320 --> 00:14:15,070
If this guy is directly connected to me.

126
00:14:15,300 --> 00:14:28,000
If this guy is directly connected to you I'm sorry it means 10:43 0 0 is 1 warp ever from me from me

127
00:14:28,240 --> 00:14:31,740
which is actually you.

128
00:14:32,030 --> 00:14:44,530
OK then after all rods are exchanged and as you can see full routing table is established for example

129
00:14:44,890 --> 00:14:55,780
rather 3 and now this Schrott 44 are two rather two and told that this guy is directly connected to

130
00:14:55,780 --> 00:15:05,740
me and rather to installed this as the one who purvey and advertised this route again to rather one.

131
00:15:06,040 --> 00:15:10,030
Rather receive it and so the head rather too.

132
00:15:10,120 --> 00:15:21,040
If this route 44 is one hip hop away from you that means it is two jobs away from me and installed he

133
00:15:21,220 --> 00:15:25,860
installed it with the hope kind of two.

134
00:15:25,930 --> 00:15:30,510
And here is the configuration of the rep.

135
00:15:30,760 --> 00:15:35,430
That's pretty straight forward guys and let's go ahead.

136
00:15:35,550 --> 00:15:38,760
Rather one rather two and rather tree.

137
00:15:38,920 --> 00:15:40,660
We're configuring.

138
00:15:40,670 --> 00:15:48,560
In this example we are typing in the coffee Mothra rather REPP as you can see in here.

139
00:15:49,090 --> 00:15:59,830
And if you're going to use the report into we are typing the version and the two words into them when

140
00:15:59,830 --> 00:16:08,940
you go to see scene here is for rather one way or two directly connected that.

141
00:16:09,280 --> 00:16:16,470
And we're reading this guys in class full state as you know that this is a B-class network.

142
00:16:16,480 --> 00:16:22,690
This is an A-class network so I'm typing the network's statements as the classroom.

143
00:16:22,690 --> 00:16:39,220
This for example network 10 000 for this network and I'm typing 170 to 16 0 0 for this network or rather

144
00:16:40,290 --> 00:16:43,880
and for other to the same logic.

145
00:16:44,070 --> 00:16:50,310
It's just connected to the Senate works as you can see this guy and this guy.

146
00:16:50,310 --> 00:16:59,310
So that's enough that I just happened that were 10 0 0 0 for this and for the other three I'm typing

147
00:16:59,310 --> 00:17:06,110
that 10 000 and the C-Class of this network.

148
00:17:06,110 --> 00:17:06,670
All right.

149
00:17:06,690 --> 00:17:08,150
That's pretty cool.

150
00:17:08,160 --> 00:17:13,490
And two were the rip configuration retails show people of course command.

151
00:17:13,500 --> 00:17:22,320
And we can display the rotting portico we are using which is rippling here and we can see the also the

152
00:17:22,410 --> 00:17:30,300
update timers and the I love it and flash and the whole don't timers as well.

153
00:17:30,300 --> 00:17:35,710
And to avoid the RIP configuration we can also use the Shope Iraq's command.

154
00:17:35,910 --> 00:17:46,980
And in the writing table as you can see we have some entries by the our key word which means the rep

155
00:17:47,160 --> 00:17:48,390
OK.

156
00:17:48,690 --> 00:17:57,990
And if you want to check the rudder to the periodic table by using the choice route command we can see

157
00:17:58,350 --> 00:18:05,310
our commands are unsorry our key words in here as well which is rare.

158
00:18:05,340 --> 00:18:16,920
And for rather two there's learning the does not work and this inner work from this guys as you can

159
00:18:16,920 --> 00:18:33,270
see I'm learning the 16 0 0 on the wire 10:42 0 1 which is here and I'm learning there now via 10:43

160
00:18:33,270 --> 00:18:36,880
0 3 which is here.

161
00:18:37,470 --> 00:18:41,660
Let's go with to reap G rape and G rape.

162
00:18:41,700 --> 00:18:49,130
Next Generation is an extension of rape for supporting IP version 6.

163
00:18:49,170 --> 00:18:56,200
The maxim hope comes again we keep using repinned G is 15.

164
00:18:56,240 --> 00:19:02,540
So let's go ahead how we can configure the Ripp energy in here to configure the rape.

165
00:19:02,690 --> 00:19:12,050
The first thing we should do on our others are the enabling the IP version 6 wadding by typing IP version

166
00:19:12,050 --> 00:19:20,960
6 unicast trawling for H rather than we are getting into the interface mods.

167
00:19:20,960 --> 00:19:24,780
Here is the difference from the Rip configuration.

168
00:19:24,890 --> 00:19:32,960
If repaint the world we are using rip Next-Generation for eye 2006 we are configuring the IP version

169
00:19:32,960 --> 00:19:38,310
6 statements under the interface mods and as you can see here.

170
00:19:38,480 --> 00:19:46,160
So we are getting into the interface more by typing for rather than for example either with the 0 0

171
00:19:46,520 --> 00:19:49,830
and the command kill is pretty straightforward.

172
00:19:49,880 --> 00:19:56,570
I perversions 6 REPP a keyword which you can is arbitrary.

173
00:19:56,570 --> 00:19:58,750
This is my read for this.

174
00:19:58,910 --> 00:20:01,460
And we're typing enabled.

175
00:20:01,580 --> 00:20:09,030
OK that's pretty straightforward and the same thing for the other interfaces as well.

176
00:20:09,530 --> 00:20:18,380
And to verify the rip N-G configuration again we can use the show IP version 6 porticoes this time and

177
00:20:18,380 --> 00:20:25,770
we can see that the IP version 6 swapping protocol and the running port of call name as you can see

178
00:20:25,770 --> 00:20:35,090
in here which you configured as Miree for the previous example and we can also use the show IP version

179
00:20:35,090 --> 00:20:46,190
6 frocked command and we can display our full routing table and we can see the Rudds learn by Ripp again

180
00:20:46,190 --> 00:20:47,330
in here.

181
00:20:47,720 --> 00:20:49,710
Let's go with the links.

182
00:20:49,830 --> 00:20:59,470
Perico runners that are using the least still working protocols held the complete map of network topology

183
00:20:59,710 --> 00:21:07,410
and they choose the best path relying on the top knowledge of table length of wording.

184
00:21:07,420 --> 00:21:10,910
We don't have any dependency to our neighbors.

185
00:21:11,050 --> 00:21:14,650
We don't care about what they tell us.

186
00:21:14,710 --> 00:21:24,060
As the distance vectors OSPF and the essays are the most commonly used links they are algorithms.

187
00:21:24,670 --> 00:21:28,100
Let's go with the Dykstra algorithm.

188
00:21:28,150 --> 00:21:35,630
We have algorithms that we use for links that Walding and one of the most popular is the Dykstra.

189
00:21:35,930 --> 00:21:44,980
Dykstra is an algorithm for finding finding the shortest paths between nodes in a graph which may represent

190
00:21:44,980 --> 00:21:53,770
for example one that works for SBF and I guess I just use this shortest path algorithm to determine

191
00:21:53,770 --> 00:21:57,700
the best path in this algorithm.

192
00:21:57,700 --> 00:22:06,930
We have cost vollies for each path representing the bandwidth of the path and lower cost meals.

193
00:22:07,060 --> 00:22:10,970
Hi is it guys there is the reverse logic in here.

194
00:22:11,140 --> 00:22:30,250
For example best path from A to Z through a C C D D and D to me we have a cost of totally Zen in here

195
00:22:30,690 --> 00:22:33,600
one plus six plus two.

196
00:22:33,900 --> 00:22:34,870
OK.

197
00:22:35,110 --> 00:22:40,920
We can also go from the path A to B and B two years.

198
00:22:40,940 --> 00:22:43,880
Well I'm sorry I'm sorry.

199
00:22:43,890 --> 00:22:46,230
This is actually not.

200
00:22:46,290 --> 00:22:47,800
This is nine.

201
00:22:47,830 --> 00:22:49,280
OK.

202
00:22:49,410 --> 00:22:53,780
One plus six plus two is nine.

203
00:22:53,850 --> 00:22:59,800
And if you were to use this path our cost is totally 10.

204
00:22:59,850 --> 00:23:06,260
And remember that if you were to use repayed near the metric would be the hope.

205
00:23:06,450 --> 00:23:15,300
And there's that this term would be preferred because we are using the just one more hops to get to

206
00:23:15,300 --> 00:23:15,840
it.

207
00:23:16,050 --> 00:23:23,250
While we are using two loaves in here let's go ahead with the link state riding operation.

208
00:23:23,250 --> 00:23:31,040
We have four steps of link state writing operation and in the first step brothers discovered they are

209
00:23:31,080 --> 00:23:39,330
directly connected neighbors and send they help pack cats in the second brother's build blink state

210
00:23:39,390 --> 00:23:45,190
packet LSP which has instead of directly connected playings.

211
00:23:45,340 --> 00:23:55,470
In other words Eliot Spitzer Faludi to all neighbors and stored in a database in the Ford database is

212
00:23:55,470 --> 00:24:01,760
used for course writing a full map of the topology.

213
00:24:02,060 --> 00:24:03,790
Let's go ahead.

214
00:24:04,370 --> 00:24:11,780
As I told in the first brothers this code they are directly connected to neighbors and send the hello

215
00:24:11,810 --> 00:24:20,360
packet's and receive a reply back from the each neighbor running the same protocol in here as you can

216
00:24:20,360 --> 00:24:28,310
see the first of the first step of the links prodding operation is sending and receiving the hello's

217
00:24:28,640 --> 00:24:38,030
and here rather one is sending the hellos from each interface and receiving back the hello packets from

218
00:24:38,030 --> 00:24:40,700
the others to our other three.

219
00:24:40,820 --> 00:24:50,910
Secondly rather build the link state packet which is LSP and which has the link still off directly connected

220
00:24:50,930 --> 00:24:51,860
links.

221
00:24:52,070 --> 00:25:03,010
For example it rather was LSP we had the informations containing the Internet which is 10:41 28 that

222
00:25:03,080 --> 00:25:08,410
0 and we will have with a volley of 5.

223
00:25:08,420 --> 00:25:16,540
As you can see in here and we are also the serial point to point link but rather one and rather two

224
00:25:16,880 --> 00:25:23,670
which is 10:41 26 and 0 never creature which is a cost of 10.

225
00:25:23,900 --> 00:25:33,780
And we also have the serial point to point link between Rather one or the three which is 10:41 to 27

226
00:25:33,800 --> 00:25:40,080
that zero with the cost of 15 in the third step.

227
00:25:40,090 --> 00:25:48,150
LS PS are fluted to all our neighbors and stored in a database.

228
00:25:48,520 --> 00:25:57,310
And finally each other establish links link state database and calculates the best path for destination

229
00:25:57,330 --> 00:26:08,110
that works best path's results are adding to our routing table let's go ahead to the writing table what

230
00:26:08,110 --> 00:26:14,140
is writing table the writing tables was information about.

231
00:26:14,160 --> 00:26:21,990
I IPN it works and how they can be reached either directly or indirectly.

232
00:26:22,190 --> 00:26:30,360
Writing table is use to reach the best path for the destination network.

233
00:26:32,460 --> 00:26:43,210
As you can see here in IPV rather running table and through these we have some frills in the force field.

234
00:26:43,210 --> 00:26:49,060
This field is identifying how the network was learned by the other.

235
00:26:49,120 --> 00:26:58,810
For example if it is learned with your GRB if events long with rep if it's loanword aesthetic wording

236
00:26:58,840 --> 00:27:01,180
or something like that.

237
00:27:01,510 --> 00:27:08,220
The second field identifies the destination network and the third field.

238
00:27:08,240 --> 00:27:18,530
I didn't phrase the administrative distance of the protocol that we're using and here this field identifies

239
00:27:18,530 --> 00:27:29,110
the metric to which the new Would that work and this field in here identifies the next hop this field

240
00:27:29,110 --> 00:27:37,810
in here identifies the amount of elapsed time since the network was discovered and the last field identifies

241
00:27:37,810 --> 00:27:50,200
the outscoring interface on the rudder to reach the destination network as summary to reach the 10 1

242
00:27:50,260 --> 00:27:59,930
1 0 network I'm using GRB with an administration to distance of 90.

243
00:27:59,990 --> 00:28:07,690
And this is my metric and I am reaching to does that work.

244
00:28:07,730 --> 00:28:11,960
Why the this IP address.

245
00:28:12,190 --> 00:28:20,510
And this is the outgoing interface of the rudder to reach the destination.

246
00:28:20,830 --> 00:28:26,720
And this is the time amount of laughs time since the network was discovered.

247
00:28:29,640 --> 00:28:31,360
Let's go to the writing table.

248
00:28:31,370 --> 00:28:38,780
Clone Cisco's IP routing table is not the flight data base guys.

249
00:28:39,000 --> 00:28:48,000
The reading table is actually a hierarchical structure that is used to speed up the lookup process when

250
00:28:48,000 --> 00:28:53,720
locating runs and forwarding packets within this structure.

251
00:28:53,760 --> 00:28:57,570
The hierarchy includes several levels.

252
00:28:57,600 --> 00:29:04,240
Routes are discussed in terms of optimal root level worlds.

253
00:29:04,470 --> 00:29:15,730
Level one parent route and the level 2 child dropped and out of a drought is a running table entry that

254
00:29:15,730 --> 00:29:16,510
contains.

255
00:29:16,540 --> 00:29:17,650
I do.

256
00:29:17,830 --> 00:29:28,240
Next stop IP version address or an exit interface directly connected dynamically learns and local routes

257
00:29:28,330 --> 00:29:30,440
are the ultimate trust.

258
00:29:30,460 --> 00:29:40,720
As you can see and here to identify the ultimate route we should see an interface or eggs point however

259
00:29:40,720 --> 00:29:49,630
you define And that's the thing we should see in ultimate routes as Level 1 route is a route with a

260
00:29:49,630 --> 00:29:59,770
subnet mask equal to or less than the class full mask of the network address L-L run parallel throughout

261
00:29:59,770 --> 00:30:02,160
it is level 1 network.

262
00:30:02,320 --> 00:30:11,520
That route that is subnets at a parent's route can never be an ultimate route and level 2 child route

263
00:30:11,560 --> 00:30:16,060
is a route that is subnet of a class whole network address.