Dijkstra & flooding ppt(Routing algorithm)

Here is my ppt on routing algorithm.
Dijkstra & flooding.

1. Shortest path algorithm( Dijkstra ) Djikstra's algorithm (named after its discover,  E.W. Dijkstra ) solves the problem of finding the shortest path from a point in a graph (the  source ) to a destination. It turns out that one can find the shortest paths from a given source to  all  points in a graph in the same time.

2. Example:-

3. Flooding Flooding  is a simple  routing algorithm  in which every incoming  packet  is sent through every outgoing link except the one it arrived on. Each node acts as both a transmitter and a receiver. This results in every message eventually being delivered to all reachable parts of the network.

4. ADVANTAGES If a packet can be delivered, it will (probably multiple times). Since flooding naturally utilizes every path through the network, it will also use the shortest path. This algorithm is very simple to implement.

5. DISADVANTAGES Flooding can be costly in terms of wasted bandwidth . Duplicate packets may circulate forever, unless certain precautions are taken

6. EXAMPLE

7. Continue…