 Hello everyone. Myself, Mr. Sevap I am Madhugar. I am working as assistant professor in computer science and engineering department at Walsh and Insta of Technology, Solaapur. Now I welcome to the session on Shortest Path Routing Algorithm, ok, learning outcome. At the end of this session, students will be able to describe the concept of Shortest Path Routing Algorithm. And second one is students will be able to describe the concept of flooding algorithm, ok. In the previous video, we have discussed about what is routing, what are the different types of routing algorithms are they by using that how the user can send the data or packets from one station to another station or from transmitter to the receiver. And Shortest Path Routing Algorithm is also one of the routing algorithm, ok. Now let us see the as end of the routing algorithm, Shortest Path Routing Algorithm, the definition of Shortest Path Routing Algorithm, then about Shortest Path Routing Algorithm, working and finding the Shortest Path to help of example, first briefly about the flooding algorithm last point, ok. Now let us see in detail about the Shortest Path Routing Algorithm, ok. Shortest Path Routing Algorithm, just definition of Routing Algorithm, a protocol that specifies how routers communicate with each other, disseminating information that enables them to select the routes between any two nodes on a computer network. In computer network, if you are sending the packet to the different users, it means which one is the Shortest Path that we have to select in this one, how the router can select? It is the idea is to build graph of the network with each node of the graph representing a router and each edge of the graph representing communication link or just link, ok. It is built to graph of the network. Next one is by using even we can also call it as a Disaster Algorithm is used in SPF that is Shortest Path First, ok, which is used in routing protocol that is OSPF Open Shortest Path First, ok. Here these two in a Disaster Algorithm is used in SPF as well as OSPF SPF is in Shortest Path First and Open Shortest Path First, this two algorithm, ok. Now to choose a route between given pair of routers, the algorithm just finds the Shortest Path between on the graph, ok. We have to find out that each node can route packets to a particular destination by calculating the Shortest Path from itself to the destination node, ok. And how we have to send or how you have to find out the basic Shortest Path computation from a given node to all other nodes is performed using Disaster Algorithm, ok. In this one, the overall concept about this one, in the Shortest Path Routing Algorithm, the concept of Shortest Path deserves some explanation. One way of measuring path length is the number of hops, ok. By using below figure, we have to find out the Shortest Path from source to the destination. Path A, B, C and A, B in the below figures are equally long. It means the Shortest Path Routing Algorithm is used to finding the Shortest Path from source to the destination. This is a simple exam or we have to consider. This is the overall diagram of the, it is a simple, simple example you have to, because there are so many nodes are there or working stations are also there A, B, C, D, E, F, G, H like this and each from A to B some distance is there and B to C also having some distances and C to D also having some distances. It means there are so many paths are there. It means A want to transfer the data to D. Then there are so many paths. How the A can transfer from A to B, B to C, C to D. Then A to B, B to E, E to F, F to C, C to D. And then A to B, B to E, E to F, F to H has to D. And then A to G, G to H has to F, F to C, C to D. And then A to H, G, G to E, E to F, F to H has to D. Like this there are so many paths are there. Instead of sending the longest, selecting the longest path, here we have to find out the which one is the shortest path by use based on the even the length also they have given between each nodes. Then we have to select the length of that and then which one is the shortest path by using that we have to send the data, the data may reach to the destination shortly. Here we have to use some steps how we have to send. Here first two steps are there. First we have to consider the step one the data is there here that is your original data in this one and then we have to send the data from A to B. Here to in bracket we have given to A, what is to distance from A to B to and then A indicates we have to issue the data or request from A and distance of A from A to B this one. To ease and distance A is the issue the data from A. And then here the actual data is there the B user may send the data to C or he may send the data to E also. Here initially do not know what is the distance and who is the sender. Next we have to in the next step they have given how we have to transfer the data from B to next step. Here the actually the data is there here we have to send the data to E and then here in a bracket we have written for B. What is for indicates here A to B two distance is a length is 2 and then B to E 2 is there 2 plus 2 is 4 and B indicates we have to issue the data from B. And then same you can go to the next diagram this is the next step in this one X will have a data is there even data B user may transfer the data to C also this is also one of the alternate path. Here A to B 2 is there and B to C 7 is there. 7 plus 2 is 9 in bracket and B they have written we have to issue the data from B. That is 9 comma B. B is the where we have to issue the data and then 9 indicates the total length from A to B and B to C. And then here 4 is there 4 is the total length and B is the issued data. And then actually the data is there here as well as here also. Then which one is shortest path we have to it means E sending the data to F it means we have to calculate the length of this one and then he has forwarded this one. Actually 4 is there here 2 is the distance 4 plus 2 is 6 and then this F is issued the data from E. In the bracket they have given 6 plus 6 comma E and then actual data is there in F as well as C also by using even the user mention of the data from E to G also. Here E to G 1 is there then 4 plus 1 is 5 and then here we have issued the data from E. Data is there in this G F H destination is there in the D. Then we may have alternate paths then F mentioned the data through C and F mentioned the data through H and H may send the data through sorry G may send the data through H. Here distance is there 5 6 is there and here 9 is there. Then we have to 3 paths next F is there in this one they have given. Then here now considering we are this point then here the user mentioned the packet data from F to H 9 and here total distance is 9 here 3 is there 3 plus 9 3 plus 6 is 9 and we have issued the data from G and then next here after receiving the data of here H 8 comma F and C in this one we have issued the data from H F to H and then next diagram they have issued the data from G to H that is 6 is there here and here 3 distance is there the 5 plus 3 is 8 and then we have issued the data from F here from this one this one okay 6 plus 2 8 is and then we have issued the data from F and we are here also after passing the data here we mentioned the data from this side as well as we have issued the data from G to H also here 9 is there after receiving the data from this to this G this one is 5 is there this distance is 4 4 plus 5 is 9 and then we have issued the data from G and here upper part I mean from F we have issued the data actually last step is there which one is the shortest path we have to send here from C 9 B is a 6 E is a 8 F is there then we have to send the data from E F C to D or H to D next step they have given then out of this one here 9 is there here 8 is there and then we have to see the this length of this part as well as this part and then which one is shortest we have to find out the shortest path okay in all the above figures first 6 steps in computing the shortest path from A to D allows the indicates the working nodes okay A to D arrows we have shown some arrows here as well as here that it means working nodes these are different nodes are there A B C D F and then currently we are in this node it means here we have shown the arrows steps 5 to 6 and then we have to send the data here the arrows indicates the working node after this one then we have to find out the shortest path between source to the destination it means just we have to calculate the length of this one and then we have to check out the alternate paths okay it's a very simple and then we have to easily find out the shortest path here this can contain one question part that is a list some applications of shortest path algorithm now pass the video and answer the above question now answer for the above question is applications of some applications of shortest path routing algorithm it is used in finding shortest path is used in geographical maps to find locations of map which refers to vertices of graph distance between the location refers to the edges it is used in IP routing to find open shortest path first it is used in the telephone network finding the path okay next flooding algorithm briefly I have explained about the flooding algorithm the flooding algorithm definition every incoming packet is sent out on every outgoing line except the line it is arrived for example if one data is arrived from the one line how except that we have to consider the remaining lines okay in a network flooding is the forwarding by router of a packet from any node to other node attached to the router except that the node from which the packet arrived means except sender remaining lines may send the data to that particular lines okay flooding is a way to distribute routing information updates quickly to every node in a large network okay here the main concept by using below figure we can discuss the concept of flooding it means here it means s is sending it means we may send the data except this one we may transfer the data to this one by using this path or this path or this path okay the flooding they have given the main disadvantage is what number of duplicate packets will be generated while transmitting the packets how to remove duplicate packets in a flooding it means using hop counter method we may reduce the number of duplicate packets using sequential number method you may we may reduce the duplicate or you may we may remove the duplicate packets and selective flooding method is also one of the method is used to remove the duplicate packets while sending the data using the flooding algorithm or in flooding algorithm okay this is about the flooding algorithm these are the references I have used for preparing the above ppt thank you