Routing algorithms: distance vector, link state
Computer Networks · Engineering
Study notes
Three routers A-B-C in a line, link B-C fails. Distance vector: B tells A 'C via me, cost 2' (stale), A tells B 'C via me, cost 3': count-to-infinity loop until 16 (RIP infinity). Link state: B floods 'B-C down'; all recompute with Dijkstra instantly. This is why OSPF replaced RIP in large networks.