|
Site home page Get alerts when Linktionary is updated Book updates and addendums
Get info about the Encyclopedia of Networking and Telecommunicatons, 3rd edition (2001)
Download the electronic version of the Encyclopedia of Networking, 2nd edition (1996). It's free! Contribute to this site Electronic licensing info
|
Bellman-Ford Distance-Vector Routing Algorithm Related Entries Web Links New/Updated Information Note: Many topics at this site are reduced versions of the text in "The Encyclopedia of Networking and Telecommunications." Search results will not be as extensive as a search of the book's CD-ROM. The Bellman-Ford distance-vector routing algorithm is used by routers on internetworks to exchange routing information about the current status of the network and how to route packets to their destinations. The algorithm basically merges routing information provided by different routers into lookup tables. It is well defined and used on a number of popular networks. It also provides reasonable performance on small- to medium-sized networks, but on larger networks the algorithm is slow at calculating updates to the network topology. In some cases, looping occurs, in which a packet goes through the same node more than once. In general, most DVR (distance-vector routing) algorithms are not suitable for larger networks that have thousands of nodes, or if the network configuration changes often. In the latter case, the routing algorithm must be able to dynamically update the routing tables quickly to accommodate changes. A more efficient routing protocol is OSPF (Open Shortest Path First). See Distance-Vector Routing for more information.Copyright (c) 2001 Tom Sheldon and Big Sur Multimedia.
|
