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.
A router forwards each packet by looking up its destination in a forwarding table; routing is the process that fills that table. Routing algorithms come in two families. In link-state routing every router learns the whole topology and runs Dijkstra's algorithm itself (Link-State Routing).
In link-state (LS) routing every router learns the complete topology of its routing domain and computes shortest paths itself.
One-page visual sheets for this topic, in the sheet library on the store. Previews are free; the full sheets come with the subject pack.
