Octet

Compare distance vector, link state and path vector routing protocols.

Show the answer

Say this first

Distance vector routers tell their neighbors which destinations they can reach and at what distance, and believe what neighbors tell them; nobody sees the whole topology. RIP is the classic example, EIGRP an advanced one. Link state routers flood a description of their own links to every router in the area, all build the same map, and each runs SPF (Dijkstra) to compute shortest paths: OSPF and IS-IS. Path vector is BGP: like distance vector, but each route carries the full list of ASes it crossed, which prevents loops and allows policy.

Go deeper

Distance vectorLink statePath vector
ExamplesRIP, EIGRPOSPF, IS-ISBGP
What is sentroutes and distancesthe router's own links (LSAs, LSPs)routes with AS path and attributes
Sent todirectly connected neighborsflooded to every router in the areaconfigured peers over TCP 179
Viewonly what neighbors reportfull topology of the areapaths and policy, no topology
AlgorithmBellman-Ford (RIP), DUAL (EIGRP)SPF (Dijkstra)best path selection
Loop preventionsplit horizon, poison reverse, holddown, max hops; DUAL feasibility conditionsame database everywhereown AS in the path means reject
Scaling toolsummarization anywhereareas and levelsaggregation, policy, route reflectors

Updates and timers

  • RIP sends its full table every 30 seconds.
  • EIGRP sends partial, bounded updates only when something changes.
  • OSPF refreshes each LSA every 30 minutes; IS-IS refreshes LSPs every 15 minutes by default. Both flood changes immediately.
  • BGP sends incremental updates and keepalives.

Traps

  • Saying link state routers send their whole routing table. They send their links, and each router computes its own table.
How did you do?Book 3.4 Routing