Link-State Routing (SPF)

• Nodes compute costs on neighboring links

• Link costs are periodically flooded through the network

• All nodes build up complete maps of the graph

• Then compute shortest paths using Dijkstra’s

Previous slide

Next slide

Back to first slide

View graphic version