Distance Vector Routing Algorithm


Distance Vector Routing Algorithm, also called the Bellman-Ford algorithm, is a routing algorithm in which every router maintains a database with one entry for each possible destination on the network.

What is Distance Vector Routing Algorithm?

Also called the Bellman-Ford algorithm, a routing algorithm in which every router maintains a database with one entry for each possible destination on the network.



The Routing Information Protocol (RIP), which is supported by Microsoft Windows NT and Windows 2000, is one example of a dynamic routing protocol that uses the distance vector routing algorithm.

How it works

When this algorithm is used by a routing protocol, each router advertises its routing table to its adjacent neighbors. Each advertisement contains the following information about each route in that routing table:

  • The hop count for the route (the distance)
  • The direction in which the route is located (the vector)




These advertisements are performed independently by all routers (that is, no synchronization exists between advertisements made by different routers). In addition, routers receiving advertisements do not generate acknowledgments, which reduces the overhead of routing protocol traffic.

Routers select the route with the lowest cost to each possible destination and add this to their own routing tables. These neighbors propagate the information to their neighbors hop by hop until information from all routers has spread throughout the entire internetwork.

Distance vector routing protocols (that is, protocols based on the distance vector routing algorithm) are simpler to understand and easier to configure than link state routing algorithm protocols. The main disadvantage of the distance vector routing algorithm is that changes are propagated very slowly throughout a large internetwork because all routing tables must be recalculated. This is called the Slow Convergence Problem.



Other disadvantages are that routing tables can become extremely large, making distance vector routing protocols unsuitable for large internetworks, and that route advertising generates a large amount of traffic overhead.

Distance Vector Routing Algorithm
Distance Vector Routing Algorithm

The following table shows correspondence between routable network protocols and distance vector routing protocols.

Correspondence Between Protocols

Network ProtocolDistance Vector Routing Protocol
IPRIP or Interior Gateway Routing Protocol (IGRP)
IPXRIP
AppleTalkRTMP




NOTE


Windows NT Server version 4 supports RIP version 1 for Internet Protocol (IP), RIP for Internetwork Packet Exchange (IPX), and Routing Table Maintenance Protocol (RTMP) for AppleTalk. Windows NT Server version 4 with Microsoft’s Routing and Remote Access Service (RRAS) installed supports RIP version 2 for IP.

Editor

Articles posted after being checked by editors.

Recent Content

link to Public Key Infrastructure (PKI)

Public Key Infrastructure (PKI)

Public Key Infrastructure, also known as PKI, is a set of services that support the use of public-key cryptography in a corporate or public setting. A public key infrastructure (PKI) enables key pairs to be generated, securely stored, and securely transmitted to users so that users can send encrypted transmissions and digital signatures over distrusted public networks such as the Internet.
link to Digital Signature

Digital Signature

Digital Signature is an electronic signature that you can use to sign a document being transmitted by electronic means such as e-mail. Digital signatures validate the identity of the sender and ensure that the document they are attached to has not been altered by unauthorized parties during the transmission.