 Now, I welcome to the session on Distance Vector Routing Algorithm ok. In the previous video we have discussed about what is a routing, what is a routing algorithm, what are the different types of routing algorithm. Today we will discuss about one of the routing algorithm that is Distance Vector Routing Algorithm ok. Let us see the learning outcome of the algorithm. At the end of the session students will be able to describe the concept of Distance Vector Routing Algorithm ok. Agenda in this video we will we will discuss about Distance Vector Routing Algorithm, advantages and disadvantages of this algorithm working of Distance Vector Routing Algorithm with the help of examples ok. Let us see one by one. What is routing algorithm? Definition of routing algorithm. Two nodes are say to be when we have to say two nodes are say to be neighbors, you both are directly connected to the same network ok. And this we can this concept we can call it as in Distance Vector Routing Algorithm. Two dynamic algorithms in particular Distance Vector Routing Algorithm and the Link State Routing Algorithm are the most familiar routing algorithms. Out of these two we will discuss only first one that is Distance Vector Routing Algorithm ok. This algorithm can operates by having each router maintain a table giving the best known distance to each other. While transmitting the data from one station to another station or from one node to the another node the router maintains a routing table giving the best result ok. These tables are updated whatever these tables are they these tables are updated by exchanging the information with the neighbors ok. Eventually every router knows the best link to each reach each destination. It means while transmitting any data packet from node 1 to node 2 all the information will be stored in the table ok. Each router exchange the information with neighbors router and each nodes keeps the distance vector and next hop counter. It is a main point each router exchange the information with neighbors neighbors routers and each nodes keep the distance vector and next hop vector ok. One entry for each destination network the vector of link cost for each directly attached network ok. It requires transmission of information by each router to all neighbors distance vector that contains estimated podcast for all destination networks exchange the exchanges may take long time to propagate ok. The table at each node also guides the packet to design node by showing the next hop routing ok. See data to be available in each router router table per destination here we have to distances we have to calculate outgoing line and then distance to all the neighbors ok. The one question then after that we can go to the examples of routing algorithm. What is this question? List some advantages sign disadvantages of distance vector routing algorithm and then now pass the video and answer the given question. Now let us wait for one minute just you can answer this given question ok. Now we can go to the answer first advantages of distance vector routing algorithm advantages are the distance vector routing protocol is easy to implement in a small network debugging is very easy in the distance vector routing protocol ok. This protocol has a very limited redundancy in a small network these are the two advantages are there. Next we can go to the disadvantages. First disadvantage is a broken link between the routers should be updated to every other router in the network. This problem is known as count to infinity ok. The time required by every router in a network to produce an accurate routing table is called convergence time ok. And then here every change in the every change in the routing table is propagated to other neighboring routers periodically which creates traffic on the network. In routing algorithm we have to use some terms convergence time and then count to infinity every time all those things these are the points will comes under the disadvantages of routing algorithm ok. Here just you can consider the example assume that each node as the cities and lines as the roads connecting them ok. Here this is a block diagram this block diagram is there in this block diagram there are different nodes are there I said here I have mentioned cities and lines what are the cities and what are the lines in this diagram it means there are total 5 nodes are there a b c d e like this the total 5 nodes are there these nodes indicates the cities from this a node to b node what is the distance is there this line indicates the roads connecting between these two cities ok. Just you can take this with the help of this example you can easily get the concept about the routing algorithm. Now we have to create the table in the previous slides we have discussed about what is how we have to create the slide and then from a to from one node to the another node while transmitting the data how the data can create through wire which node we are transmitting that they have given in this one first we have to create the table for first node if you are here you want to go to the next city it means through which node you are transmitting you are going and then what is the distance or what is the cost of that node we have to find out just we can consider first city or node as a a from a to a there is no cost because source is this one and destination is this one and then if you are going from a to b then b through b you are going what is the cost of this one is 5 here they have given b 5 the wire next node is no and then from a to c you are going the next node is c distance is 2 in this one they have given c is 2 wire nothing ok and then a to d you are going distance is 3 d is and 3 and then a to e you are going through c you are going c in this one they have given here in the last point e 6 c what indicates you are going from a to e through c node here from a to c 2 is there and then distance is 2 meter and then c 2 is 2 meter this 4 plus 2 total 6 here the cost of this one is 6 this is a s table from cta you may go to b c d and e wire different lines same pattern we have to create just you can come to the b node or bct if you want to go from bct to e c a and d how we have to same thing from b to a you are going it means distance we have to find out that is 5 and b to b is 0 and then from b to c you are going it means 4 is there that is 4 c to 4 and b to d you are going it means 8 is there that is b to d how they have given b to d this here d is there you are going via a here they have given a d a a it indicates your source is a b destination node is d you are going through a distance is 5 plus 3 total 8 cost of this one is cost of this road is 8 next from b to e directly you can the distance is 3 or cost is 3 wire there is a known heat same thing for is also if you are going from e to b e to c e to a and e to d 8 from e to a 6 is a from e to a 4 plus 2 total 6 is there via c you are going next e to b 3 is there then e to c that is the where is c e to c you are going to c it means 4 is there here and then e to d 4 is they have given that is 9 through e this one is 0 through you are going it means 0 is there next you can come to this one c through c you are going it means again for d why we have to go through a ok a to c to a 2 is a c to b 4 is a c to c 0 c to d we have to calculate this 3 2 plus 3 and then via a you are going and then d or if you are going c to e it means 4 is there here then same thing you have to create. So, based on this one d is also there here in this ones d if you are going it means d to a 3 they have given d to b again we have to go through via a and then a distance is there 5 plus 3 plus 5 8 and then again c if you are going from d to c it means 3 plus 2 is 5 total 5 through a you are going and then d to d 0 d to your e you are going it means e d first you have to go through via e it means here total 5 plus 3 a and then again 1 1 more is there that is 9 through via a you are going d to e ok. So, like this you have to create the table and then we have to find out the distance between each node sign cities. These are the references I have used to refer the I have used to prepare the above repeat ok. Thank you.