Dijkstra Flashcards
(2 cards)
1
Q
Dijkstra
A
Link state algorithm where routers exchange information using link state packets ( LSP)
All the routers have an identical and complete view of the network share through a broadcast link.
Each node can run the Link state algorithm and obtain the same set of least-cost paths as every other node.
Greedy algorithm that finds the best local optimal solution but not global optimum.
2
Q
OSPF ( Open shortest path first )
A
Used in large scale networks to determine the shortest path between routers.
