O'Reilly logo

Implementing Cisco Networking Solutions by Harpreet Singh

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

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. ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required