Network, Computer and Programming Resources

Network - Protocol, Distance-Vector

A distance-vector protocol is any of several routing protocols that use a distance-vector algorithm to determine available connections. With a distance-vector protocol, each router transmits information about the cost of reaching accessible destinations to each of the router's neighbors. Examples of distance-vector protocols include the following: n RIP (Routing Information Protocol) from the TCP/IP protocol suite, but also used in other suites n RTMP (Routing Table Maintenance Protocol) from the AppleTalk suite n IDRP (Interdomain Routing Protocol) from the OSI suite Distance-vector protocols are in contrast to link-state protocols, which use a different strategy for getting routing information. Distance-vector protocols provide information about the costs of reaching all possible destinations, whereas link-state strategies provide information only about the distances from a router to all its immediate neighbor routers. The distance-vector strategy requires more work when setting up or updating the routing information. In contrast, link-state protocols need to do more work during the actual routing. BROADER CATEGORY Protocol, Routing COMPARE Protocol, Link-State