distance vector protocol

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.

Copyright © 1981-2025 by The Computer Language Company Inc. All Rights reserved. THIS DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher.