distance vector protocol


Also found in: Acronyms.

distance vector protocol

A simple routing protocol that uses distance or hop count as its primary metric for determining the best forwarding path. RIP, IGRP and EIGRP are examples. A distance vector protocol routinely sends its neighboring routers copies of its routing tables to keep them up-to-date. Distance vector protocols date back to the ARPAnet network in the early 1970s. Contrast with link state protocol and path vector protocol. See routing protocol.
References in periodicals archive ?
As is known, because it is a distance vector protocol, DVMRP works with source trees (SPT).
The Secure Efficient Ad hoc Distance vector protocol SEAD (by Hu, Johnson and Perrig [7]).
A major difference between distance vector and link state protocols is that whilst the distance vector protocol learns the routing table and distant routers from directly connected neighbors, link state protocols learn the entire topology of a network [15].
This paper represents an analysis for the performance of Link State Protocols and Distance Vector Protocols in Mobile Adhoc networks.

Full browser ?