Computer Networking › Section E · The network layer: control plane › Topic E.1

Routing algorithms: link state and distance vector

Forwarding tables do not fill themselves. Behind every table is a routing algorithm that treats the network as a graph and finds good paths through it. Two families dominate: link state, where every router sees the whole map, and distance vector, where routers learn only from their neighbours.

In this topic

  • The control plane's job
  • Networks as graphs
  • Link-state routing and Dijkstra
  • Worked example: Dijkstra from A
  • Costs of link state
  • Distance-vector routing and Bellman-Ford
  • Worked example: one Bellman-Ford update
  • Count to infinity
  • Comparing the two
  • Common mistakes to avoid
  • Key takeaways

This topic is part of Wuanberri Pro. Checking your access…

← Previous topicNext topic →