Computer Networks · topic
Distance-vector routing with the Bellman-Ford equation, synchronous table rounds, count-to-infinity, split horizon and poison reverse; link-state routing with flooding of link-state advertisements and a Dijkstra trace; when each is used and how they compare.
Distance-vector routing for GATE CS: the Bellman-Ford equation, what each router knows and sends, one table update from neighbour vectors, synchronous rounds on a six-router network until convergence, why good news travels fast and bad news slowly, the count-to-infinity table after a link failure, and how split horizon and poison reverse help (and where they fail). RIP's choices are tagged as implementation details. All tables come from a script.
A partial preview of the top of the sheet. The full sheet is in the Computer Networks cheat sheet pack.
Link-state routing for GATE CS: what a link-state advertisement holds, reliable flooding with sequence numbers and its message count, Dijkstra's algorithm traced step by step on a six-router network with a tie, reading paths and next hops into a forwarding table, complexity, and a side-by-side comparison with distance-vector routing, plus a solved 2025 matching question. Every trace comes from a script.
A partial preview of the top of the sheet. The full sheet is in the Computer Networks cheat sheet pack.
