Distance-Vector Protocols are a type of routing protocol used in computer networks to determine the best path for data to travel. They work by having each router share its knowledge of the network with its immediate neighbors. Each router maintains a table that lists the distance to various destinations, which is updated based on the information received from neighboring routers. These protocols use a simple algorithm where routers periodically send their distance tables to neighbors. The distance is typically measured in hops, or the number of routers a packet must pass through. Examples of Distance-Vector Protocols include Routing Information Protocol (RIP) and Interior Gateway Routing Protocol (IGRP).