In the section we're going to talk about dynamic writing.
And let's start with the dynamic writing protocols stick rubbing elbows writing tables in specific words
to be set up by the network administrator dynamic wording use writing protocols that dynamically discovered
network destinations and how to get them dynamic writing allows writing tables in rudders to change
if rather on the rug goes down or if a network is added in dynamic running routing protocols running
in routers continuously exchange network status updates between each other as broadcast or multicast
with the help of Rawling update message sent by the routing protocols rather than continuously update
the writing table.
When the error or topology change happens and Nesco here is the good the worse is guys static routing
words the dynamic writing static running is Ed Menil the configure crowding in entry and must be manually
updated.
If topology changes this is suitable for very small networks and requires less C.P. usage and that may
be fun to use two or froma subnetwork Sedrick riding we can use in a subnetwork and it is easy to implement
and we we're just wording one statement that points at destination and the subnet mask and the next
stop.
Let's go ahead with the dynamic routing dynamic writing uses running protocols that dynamically discone
destinations as you now and automatically update that if topology change.
That's the biggest advantage worth.
Biggest advantage when you compare with the static routing and that is suitable for large networks because
of this and where rapid convergence times for that dynamic routing.
And we may require more C-p your let's go ahead.
We have dynamic protocols work rather sands and Lucile's running message on its interfaces Firstly then
rather his message with other others using the same protocol in the third stepbrother's Xchange rather
information each other.
And lastly if rather direct and topology change it advertises things to other riders.
Let's go ahead with IGP and the EU piece.
Actually guys we're two types of dynamic routing protocols and they are I yippies and the Egypt piece
Id piece are used to exchange routes in the same autonomous systems and support small medium and the
large scale organizations.
But scale liberalitie is limited.
For example this is the number 100 as you see.
And here is the inside of the s 100.
So in here the protocols I'm using are the eye piece.
All right.
Let's go ahead and I can quickly commercial network and the most commonly used IGY piece are Yager P
OSPF and the use of rape is very limited.
And I espies also ISIS as the IGP.
And let's go ahead with the EDP.
Egypt is are used to exchange routes between different autonomous systems and BGP is the only Egypt.
Today the main function of the BJP is to Xchange a large number of fronts between different alternate
systems.
For example here is a has 200.
And here is a 100.
If you want to exchange routes between is 100 and the is 200.
We're using Egypt.
And the BJP is the only AJP we are using today.
Let's go with the dynamic wording.
Perko classes we have three classes of dynamic writing porticoes and their distance their links state
and their pet vector.
This is why the protocols route according to the hope count guys.
Every brother knows as much as its neighbor tells him there is no network map on the rudders for example
rape and IGP are the distance away of Pericles.
Let's go to the links that routing protocols rather than running the links still writing protocols can
extract the topology map of the entire network.
That is they have knowledge of all the ways between two points.
Thus they collect all the subnets in a tree and make the best decision about which way to go with the
shortest path algorithm.
They decide according to plan width delay and something like that and the links stay poor because our
OSPF and the ISIS and let's go ahead with the path vectorizing porticos Rodd's.
Information is used to determine the best.
What's similar to this.
This and Schwitters others do not have a network map in Pethick to riding to and the BGP is the only
path vector running per call and here is the worse choice between this inspectors and the links there
porticoes.
This is way too porticos recurred that rather inform its neighbors of topology change parametrically
and their grip.
And yet Europeans I told Jean are pros slight lynxes poor of course have the complete left that map
of the network topology and they choose the best path relying on their topology.
They both and we have no neighbored dependency in here and oil spill.
And I essay's are the links that poor of course and let's go ahead with the class full worthless class
list part of course class food particles in Glasgow particles subnet mask is not sent in writing updates
and we can use class A B or C and we can make class A B or C shearling by using declasse protocols and
as we as they are classless I'm sorry as they are classful we have no CDR or real or some support and
live version 1.
And the GOP which is the old form the IGMP are the class food protocols classless porticos subnet mask
is sent in writing updates and we can make classless writing.
So we have CDR and we had some support.
And version 2 Edgeware P ISIS and the OSPF are the classless protocols.
Here is a general running porticos comparison chart.
And here are the distance vector porticos rape and GOP BJP is perfect.
But you may also see it as distance vectors in some measure the link step porticoes are ISIS and the
OSPF as you can see the classless ones are reversion to the GOP.
I assayers oils P.F. and e.g. peep arms are BGP and above.
If you want to check the wheel or some support.
As I told you in our previous life we don't have allow some support for the Persian one we can't use
the rep in small size the.
We can use.
Yeah Japie ISIS in large networks and we can use BGP in very large networks.
As Internet as well and the metric Kanda of the trip is the hop.
Yeah jumping is a composite metric.
I say as has the metric OSPF metric is known as cost and BGB has paired attributes at as the metric
and we are going to take a deeper look to all of these features on our later sections.
And if you want to check about the convergence time rip current work conquerer can come much slower.
Yes GAAP can converge very fast.
I say is fast and DGP is the slowest merging protocol.
Let's go ahead with the distance Wiktor dynamic routing and rape and the rape and G or guess where others
use the distance with the protocols.
They send updates to their neighbor so they all know what their neighbors says and they don't know the
details in the topology rape and yeah Arpey are the most commonly used distance waiter Porter.
As I told you our purse slide rip is a distance vector protocol rather is that are using grip Pirko
create the old running table based on information exchange between brothers and this for others.
This rather sent running updates each 30 seconds to each other as broadcast for free persion one and
as multicast as is multicast in reape version to re-appears is the Belman for the algorithm guys.
And the actual metric of rip is the hop count Ripken's support a maximum or count of others for example
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
work the best path will be the path Abbo the class we will is just one more hoops to get to destination.
But for the link below as you can't see any here we use two more hops which means two more rounders
to get to destination and which means the worst path for the rep.
That's why we are using this path instead of this path.
If we are using rape as a dynamic routing protocol so let's go ahead with how we can establish a running
table in rep.
The first stage in the first stage all others installed they are directly connected to the running table
as you can see rather one installs 10:41 and 10:42.
This guy installs the forty two and three and this guy is two forty three and the forty four.
Then in the next page results are exchanged between neighbors and the routing tables begin to grow.
As you can see in here this guy knows this that works firstly and rather to knows about this and this
guy knows about this one.
Then they are starting to exchange rods with each other.
For example rather to say is rather one that hayride around.
I have a network which is then 14:3 and that is directly connected to me which means zero as Hop counts
and rather one installs this to its warning table.
As you can see the network 10 43 0 0 and the interface is the first eternal 0.
As you can see and the hope count is one because rather two is saying that pay for delivery is directly
connected to me rather who's up and gets this update and says that rather too.
If this guy is directly connected to me.
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
which is actually you.
OK then after all rods are exchanged and as you can see full routing table is established for example
rather 3 and now this Schrott 44 are two rather two and told that this guy is directly connected to
me and rather to installed this as the one who purvey and advertised this route again to rather one.
Rather receive it and so the head rather too.
If this route 44 is one hip hop away from you that means it is two jobs away from me and installed he
installed it with the hope kind of two.
And here is the configuration of the rep.
That's pretty straight forward guys and let's go ahead.
Rather one rather two and rather tree.
We're configuring.
In this example we are typing in the coffee Mothra rather REPP as you can see in here.
And if you're going to use the report into we are typing the version and the two words into them when
you go to see scene here is for rather one way or two directly connected that.
And we're reading this guys in class full state as you know that this is a B-class network.
This is an A-class network so I'm typing the network's statements as the classroom.
This for example network 10 000 for this network and I'm typing 170 to 16 0 0 for this network or rather
and for other to the same logic.
It's just connected to the Senate works as you can see this guy and this guy.
So that's enough that I just happened that were 10 0 0 0 for this and for the other three I'm typing
that 10 000 and the C-Class of this network.
All right.
That's pretty cool.
And two were the rip configuration retails show people of course command.
And we can display the rotting portico we are using which is rippling here and we can see the also the
update timers and the I love it and flash and the whole don't timers as well.
And to avoid the RIP configuration we can also use the Shope Iraq's command.
And in the writing table as you can see we have some entries by the our key word which means the rep
OK.
And if you want to check the rudder to the periodic table by using the choice route command we can see
our commands are unsorry our key words in here as well which is rare.
And for rather two there's learning the does not work and this inner work from this guys as you can
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
0 3 which is here.
Let's go with to reap G rape and G rape.
Next Generation is an extension of rape for supporting IP version 6.
The maxim hope comes again we keep using repinned G is 15.
So let's go ahead how we can configure the Ripp energy in here to configure the rape.
The first thing we should do on our others are the enabling the IP version 6 wadding by typing IP version
6 unicast trawling for H rather than we are getting into the interface mods.
Here is the difference from the Rip configuration.
If repaint the world we are using rip Next-Generation for eye 2006 we are configuring the IP version
6 statements under the interface mods and as you can see here.
So we are getting into the interface more by typing for rather than for example either with the 0 0
and the command kill is pretty straightforward.
I perversions 6 REPP a keyword which you can is arbitrary.
This is my read for this.
And we're typing enabled.
OK that's pretty straightforward and the same thing for the other interfaces as well.
And to verify the rip N-G configuration again we can use the show IP version 6 porticoes this time and
we can see that the IP version 6 swapping protocol and the running port of call name as you can see
in here which you configured as Miree for the previous example and we can also use the show IP version
6 frocked command and we can display our full routing table and we can see the Rudds learn by Ripp again
in here.
Let's go with the links.
Perico runners that are using the least still working protocols held the complete map of network topology
and they choose the best path relying on the top knowledge of table length of wording.
We don't have any dependency to our neighbors.
We don't care about what they tell us.
As the distance vectors OSPF and the essays are the most commonly used links they are algorithms.
Let's go with the Dykstra algorithm.
We have algorithms that we use for links that Walding and one of the most popular is the Dykstra.
Dykstra is an algorithm for finding finding the shortest paths between nodes in a graph which may represent
for example one that works for SBF and I guess I just use this shortest path algorithm to determine
the best path in this algorithm.
We have cost vollies for each path representing the bandwidth of the path and lower cost meals.
Hi is it guys there is the reverse logic in here.
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
one plus six plus two.
OK.
We can also go from the path A to B and B two years.
Well I'm sorry I'm sorry.
This is actually not.
This is nine.
OK.
One plus six plus two is nine.
And if you were to use this path our cost is totally 10.
And remember that if you were to use repayed near the metric would be the hope.
And there's that this term would be preferred because we are using the just one more hops to get to
it.
While we are using two loaves in here let's go ahead with the link state riding operation.
We have four steps of link state writing operation and in the first step brothers discovered they are
directly connected neighbors and send they help pack cats in the second brother's build blink state
packet LSP which has instead of directly connected playings.
In other words Eliot Spitzer Faludi to all neighbors and stored in a database in the Ford database is
used for course writing a full map of the topology.
Let's go ahead.
As I told in the first brothers this code they are directly connected to neighbors and send the hello
packet's and receive a reply back from the each neighbor running the same protocol in here as you can
see the first of the first step of the links prodding operation is sending and receiving the hello's
and here rather one is sending the hellos from each interface and receiving back the hello packets from
the others to our other three.
Secondly rather build the link state packet which is LSP and which has the link still off directly connected
links.
For example it rather was LSP we had the informations containing the Internet which is 10:41 28 that
0 and we will have with a volley of 5.
As you can see in here and we are also the serial point to point link but rather one and rather two
which is 10:41 26 and 0 never creature which is a cost of 10.
And we also have the serial point to point link between Rather one or the three which is 10:41 to 27
that zero with the cost of 15 in the third step.
LS PS are fluted to all our neighbors and stored in a database.
And finally each other establish links link state database and calculates the best path for destination
that works best path's results are adding to our routing table let's go ahead to the writing table what
is writing table the writing tables was information about.
I IPN it works and how they can be reached either directly or indirectly.
Writing table is use to reach the best path for the destination network.
As you can see here in IPV rather running table and through these we have some frills in the force field.
This field is identifying how the network was learned by the other.
For example if it is learned with your GRB if events long with rep if it's loanword aesthetic wording
or something like that.
The second field identifies the destination network and the third field.
I didn't phrase the administrative distance of the protocol that we're using and here this field identifies
the metric to which the new Would that work and this field in here identifies the next hop this field
in here identifies the amount of elapsed time since the network was discovered and the last field identifies
the outscoring interface on the rudder to reach the destination network as summary to reach the 10 1
1 0 network I'm using GRB with an administration to distance of 90.
And this is my metric and I am reaching to does that work.
Why the this IP address.
And this is the outgoing interface of the rudder to reach the destination.
And this is the time amount of laughs time since the network was discovered.
Let's go to the writing table.
Clone Cisco's IP routing table is not the flight data base guys.
The reading table is actually a hierarchical structure that is used to speed up the lookup process when
locating runs and forwarding packets within this structure.
The hierarchy includes several levels.
Routes are discussed in terms of optimal root level worlds.
Level one parent route and the level 2 child dropped and out of a drought is a running table entry that
contains.
I do.
Next stop IP version address or an exit interface directly connected dynamically learns and local routes
are the ultimate trust.
As you can see and here to identify the ultimate route we should see an interface or eggs point however
you define And that's the thing we should see in ultimate routes as Level 1 route is a route with a
subnet mask equal to or less than the class full mask of the network address L-L run parallel throughout
it is level 1 network.
That route that is subnets at a parent's route can never be an ultimate route and level 2 child route
is a route that is subnet of a class whole network address.