Downloaded 228 times
Uploaded byAnshul gour
Dijkstra & flooding ppt(Routing algorithm)
Dijkstra's algorithm finds the shortest path from a starting node to all other nodes in a graph. It does this by examining all possible paths from the starting node and progressively eliminating longer paths, until arriving at the shortest path to each node. Flooding is a simple routing algorithm where every incoming packet is sent through every outgoing link except the one it arrived on, ensuring delivery but wasting bandwidth through duplicate packets circulating forever without precautions.
More Related Content
Similar to Dijkstra & flooding ppt(Routing algorithm)
Dijkstra & flooding ppt(Routing algorithm)
- 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.
- 7. Flooding Floodingis 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.
- 8. ADVANTAGES Ifa 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.
- 9. DISADVANTAGES Floodingcan be costly in terms of wasted bandwidth. Duplicate packets may circulate forever, unless certain precautions are taken
- 10.
- 11.