Diikstra' s algorithm implementation Centralized version: Single node gets topology information and computes the routes Routes can then be broadcast to the rest of the network Distributed version: each node i broadcasts i dij all j] to all nodes of the network; all nodes can then calculate shortest paths to each other node Open Shortest Path First (oSPF)protocol used in the internetEytan Modiano Slide 14 Dijkstra’s algorithm implementation • Centralized version: Single node gets topology information and computes the routes – Routes can then be broadcast to the rest of the network • Distributed version: each node i broadcasts {dij all j} to all nodes of the network; all nodes can then calculate shortest paths to each other node – Open Shortest Path First (OSPF) protocol used in the internet