🗺️

Routing Algorithms: Link State vs Distance Vector

Medium

Free preview · 2 of 5 steps

Two philosophies: share tables or share topology

Routing algorithms face the fundamental question: how does each router learn about the entire network? Two approaches emerged:

Distance Vector (RIP, EIGRP): each router tells neighbors 'how far I am to each destination'. Simple but slow to converge and vulnerable to routing loops.

Link State (OSPF, IS-IS): each router tells everyone 'what links I have'. Every router builds a complete map and runs Dijkstra's algorithm independently — fast convergence, no loops.

Packets in motion — click to inspect:

1 / 2

Space to play/pause · ← → to step