Connected: An Internet Encyclopedia

 Wednesday 20 August 2008 18:25:20 1219256720
Distance-Vector Routing Protocols

Up: Connected: An Internet Encyclopedia
Up: Topics
Up: Functions
Up: Routing

Prev: Routing Tables
Next: Link State Routing Protocols

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.

Next: Link State Routing Protocols

Connected: An Internet Encyclopedia
Distance-Vector Routing Protocols

 

 

Associate sites:

Affordable Webhosting and domain hosting, Cheap domains registration, Cheap domain names
 

This site is sponsored by the courtesy of Active-Domain.com
 
Perfect works are rare, because they must be produced at the happy moment when taste and genius unite; and this rare conjuncture, like that of certain planets, appears to occur only after the revolution of several cycles, and only lasts for an instant.