distance-vector routing protocol

It belongs to the same basic family of distance-vector routing protocols.

AODV is, as the name indicates, a distance-vector routing protocol.

Distance-vector routing protocols use the Bellman-Ford algorithm.

Distance-vector routing protocols are based on a distributed form of Bellman-Ford algorithm to find shortest paths.

BGP is a path vector protocol or a variant of a Distance-vector routing protocol.

This contrasts with distance-vector routing protocols, which work by having each node share its routing table with its neighbors.

Split horizon is one of the methods used to prevent Routing loop problems due to the slow convergence times of distance-vector routing protocols.

Some distance-vector routing protocols, such as RIP, use a maximum hop count to determine how many routers traffic must go through to reach the destination.

The interior gateway protocols can be divided into two categories: distance-vector routing protocol and link-state routing protocol.

The conventional solution is to use a distance-vector routing protocol such as AODV, which usually transmits no data about routing.

While EIGRP is indeed an advanced distance-vector routing protocol, it is not a hybrid protocol.

Babel (protocol) (a distance-vector routing protocol for IPv6 and IPv4 with fast convergence properties)

WRP uses an enhanced version of the distance-vector routing protocol, which uses the Bellman-Ford algorithm to calculate paths.

The Routing Information Protocol (RIP) is a distance-vector routing protocol, which employs the hop count as a routing metric.

Distance-vector routing protocols in computer networks use route poisoning to indicate to other routers that a route is no longer reachable and should not be considered from their routing tables.

A distributed variant of the Bellman-Ford algorithm is used in distance-vector routing protocols, for example the Routing Information Protocol (RIP).

A link-state routing protocol is one of the two main classes of routing protocols used in packet switching networks for computer communications (the other is the distance-vector routing protocol).

EIGRP is an advanced distance-vector routing protocol, with optimizations to minimize both the routing instability incurred after topology changes, as well as the use of bandwidth and processing power in the router.

In computer networking, split-horizon route advertisement is a method of preventing routing loops in distance-vector routing protocols by prohibiting a router from advertising a route back onto the interface from which it was learned.

The Babel routing protocol is a distance-vector routing protocol for Internet Protocol packet-switched networks that is designed to be robust and efficient on both wireless mesh networks and wired networks.

Newer distance-vector routing protocols (BGP, EIGRP, DSDV, Babel) have built-in loop prevention: they use algorithms that assure that routing loops can never happen, not even transiently.