Internet Routing

Algorithm

Distance-Vector (RIP-like) Link-State (OSPF-like)

Source router Destination router Topology

Edit mode

Animation speed

Stats

AlgorithmDistance-Vector

Nodes0

Links0

Rounds to converge—

Best-path cost—

Hop count—

StatusReady

Routers find paths by sharing what they know. Distance-Vector swaps distance tables with neighbours each round (Bellman-Ford); Link-State floods the full map then runs Dijkstra. Cut a link to watch routes reconverge.