Distance vector routing
Distance vector algorithms are also sometimes known as Bellman-Ford algorithms. These algorithms rely on the routing devices periodically advertising copies of their routing tables to their immediate network neighbors. Each recipient then adds a cost or distance value to each route received in the table and forwards it to its immediate neighbors. This process occurs for all connected neighbors. Each router runs the Bellman-Ford algorithm on the received copies and creates a routing table of its own, based on the lowest cost or distance value. When the process is complete, each router has a routing table that is optimized for the lowest distance to each known prefix, but with no visibility of the topology of the network. ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access