Currently At: Internet Encyclopedia > Functions > Routing > Distance-Vector Routing Protocols
Distance-Vector Routing Protocols
This type of routing protocol requires that each router simply inform
its neighbors of its routing table. For each network
path, the receiving routers pick the neighbor advertising the
lowest cost, then add this entry into its routing table for
re-advertisement. Hello and
RIP are common D-V routing protocols.
Common enhancements to D-V algorithms include
split horizon,
poison reverse,
triggered updates,
and
holddown.
You will find a good discussion of D-V,
or
Bellman-Ford algorithms in
RIP's protocol specification,
RFC 1058.
