A centralized algorithm also known as a Link-state (LS) algorithm is a type of routing algorithm that has access to complete information about the network's topology and link costs. It computes the least-cost path between source and destination with full knowledge of the network.It can be implemented centrally or in every router's routing component.
Dijkstra Algorithm is a type of centralized routing algorithm that uses complete network information to determine the shortest path. Routers maintain a network map and share link cost information between them to compute the most efficient path using global state information.
Current Node:
Distance =
Neighbor Node:
If the calculated distance is less than the shortest known distance, the shortest distance is updated
Distance < Shortest known Distance =