| Computer Desktop Encyclopedia: 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.
Download Computer Desktop Encyclopedia to your iPhone/iTouch
| 5min Related Video: distance vector protocol |
 | NLSP (technology) |
| path vector protocol (technology) |
| link state protocol (technology) |
 | What are different between link state and distance vector protocol? |
| How differ from link state algorithm to Distance-vector routing protocol? |
| What is the port number for distance vector protocol? |
Copyrights:
 |
 | Computer Desktop Encyclopedia. THIS COPYRIGHTED DEFINITION IS FOR PERSONAL USE ONLY. All other reproduction is strictly prohibited without permission from the publisher. © 1981-2009 Computer Language Company Inc. All rights reserved. Read more |
Mentioned in
